
	Where results make sense

Topic: Graph structured stack

Related Topics

graph theory

Glossary of graph theory

graph of a function

graph mathematics

tree graph theory

Graph coloring

planar graphs

directed graphs

complete graph

graphing calculator

directed acyclic graph

Perfect graph

In the News (Sun 3 Jun 12)

EXECUTIVE POWER

Iran

ANALYSIS

Pakistan

Family compact

	Graph-structured stack (Site not responding. Last check: 2007-10-12)
		In computer science, a graph-structured stack is a directed acyclic graph where each directed path is a stack.
		They are used in parsing to efficiently simulate nondeterminism for ambiguous grammars.
		Another way to simulate nondeterminism would be to duplicate the stack as needed.
	publicliterature.org /en/wikipedia/g/gr/graph_structured_stack.html (92 words)

	Mathematical Background (Site not responding. Last check: 2007-10-12)
		A common application of graph or tree walking algorithms is the translation of a parse tree or a conceptual graph to some natural or artificial language.
		When bipartite graphs are used to represent conceptual graphs (CGs), the nodes in set C are called concepts and the nodes in set R are called conceptual relations.
		To simplify the drawings, a common convention for acyclic graphs is to omit the arrows on the arcs, but to assume that the arcs are directed either from the higher node to the lower node or from the lower node to the higher.
	www.jfsowa.com /logic/math.htm#Graph (14436 words)

	Stack Computers: Appendix A -- A Survey of Computers with Hardware Stack Support
		However, since the C language uses stacks to allocate storage for local parameters, most of the operand data references are to memory locations relative to a stack pointer register.
		While the stack implementation was not specified, Mesa follows the general pattern of machines with a small stack buffer and the bulk of the stack in program memory.
		The stack management unit internally buffered the top stack elements in high speed registers, and allowed for a single stack memory to be partitioned into several simultaneously used stacks.
	www.ece.cmu.edu /~koopman/stack_computers/appa.html (6275 words)

	John Regehr's Stack Bounding Page
		Stack overflow is what happens when an execution stack smashes memory that is being used for other purposes.
		However, stack overflow is a common source of crashes in embedded systems that have relatively little RAM and often lack an MMU.
		Stack overflow is difficult to diagnose because the worst-case stack size is typically encountered only rarely, for example when several interrupts happen to be signaled at almost the same time.
	www.cs.utah.edu /~regehr/stacktool (1358 words)

	Elkhound Algorithm
		The Elkhound Graph-Structured Stack carries sufficient information (in the form of the "deterministic depth") to tell when a given parse action (shift or reduce) can be performed using the ordinary LR algorithm.
		The problem is with the granularity of the GSS Node worklist; it forces certain actions (all those associated with the node) to happen together, even when something else should happen in between.
		This is mostly a minor detail, but using reference counting in the GSS produces much better locality than garbage collection alone (and manual deallocation is impossible due to the nature of the algorithm).
	www.cs.berkeley.edu /~smcpeak/elkhound/sources/elkhound/algorithm.html (803 words)

	LR parsing
		A LR parser consists of a stack and a state table.
		A reduce action causes the parser to pop a suitable number of symbols off the stack, make the state the one now on top of the stack, and push the nonterminal representing rule n onto the stack, followed by the state specified for that nonterminal in the goto part of the state table.
		That is, if we're reducing using a rule Y -> '(' ')', we pop 4 symbols (2 states and 2 symbols) off the stack, choose the goto state for Y using the state that is now on top of the stack, and push Y and the goto state onto the stack.
	www.logicalshift.demon.co.uk /unix/parse/lr.html (502 words)

	Algorithms and Data Structuresn II
		Undirected graph: the degree of a vertex is the number of edges incident to it.
		Directed graph: the out-degree is the number of (directed) edges leading out, and the in-degree is the number of (directed) edges terminating at the vertex.
		A spanning tree of a graph is a connected subgraph that is a tree and spans all vertices.
	www.seas.gwu.edu /~cheng/151/graph1/graph1.html (3521 words)

	Romanian Language Technology (Site not responding. Last check: 2007-10-12)
		Each vertex of the graph represents an element (a parse state) in some of the stacks merged in the structure and each leaf of the graph corresponds to an active parsing process, and acts as its top of stack.
		When two or more processes are in the same state (have the same state in their top of stack), they will exhibit the same behavior until the state is popped by some reduce action.
		All the tops of stack with shift actions are held in shift-stack, and all having reduce actions are held in reduce-stack.
	www.racai.ro /books/awde/ciocoiu2.html (550 words)

	[No title] (Site not responding. Last check: 2007-10-12)
		The expression is parsed into tokens, and * converted to RPN using a standard stack technique.
		* The stack technique involves using 3 stacks, an infix stack, a hold stack, * and an RPN stack.
		Following a algorithm, items on the infix stack are * tested, and based on what is on the top of the HOLD stack, one of 5 "ACTION" * constants are followed.
	www.owlnet.rice.edu /~mwfriedm/graph/ExpressionStack.java (271 words)

	Zoomgraph version 0
		A zoomable interface to large graphs. Zoomable means you can smoothly zoom in and out and easily move between nodes. It’s not exactly what you would expect and is a little hard to explain, you’ll have to try it.
		The graph that popped up represents a corporate communication network. Each node represents an employee (with a department property), and each edge represents communication between two employees (with a frequency property on the edge indicating the number of undirected communications).
		Mutes all graph objects if no argument is specified. Muted nodes are shown in the muted color (default gray). If a list is supplied only mutes the objects in the list. This can be a mix of edges and nodes.
	www.hpl.hp.com /research/idl/projects/graphs/doc/zg-manual.html (3957 words)

	Hypercard stacks
		This stack is widely distributed in Hypercard circles as being the most friendly format in which to read the FAQ.
		Any tag can be made the "active tag." The stack is set up so that is easy to navigate to the next card bearing the active tag, to search for the active tag in the text of any or all cards, and to export the text of the cards with the active tag.
		The stack is designed to be emptied of its current contents and used for your own purposes.
	home.comcast.net /~pmbrig/hypercard.html (2499 words)

	CodeViz
		A full graph is extremely large and unlikely to be rendered in a reasonable amount of time.
		Result: Output graph is still massive but a glance at the graph shows that a call to "shrink_cache()" is resulting in a massive graph below it that does not look like it is directly related to page allocation.
		With a large input graph, the longest operation for the generation of the call graph is the reading of the input file.
	www.csn.ul.ie /~mel/projects/gengraph (2496 words)

	CSc 520 Principles of Programming Languages :
		The internal structure of activation records and structured variables is described by run-time templates.
		A root cell is any pointer on the stack or in global memory which points to objects on the heap.
		A depth-first-search makes use of a stack, and the size of the stack will be the same as the depth of the object graph.
	www.cs.arizona.edu /~collberg/Teaching/520/2005/Html/Html-39/index.html (737 words)

	ACM Sigarch Comp. Arch. News 22, 1 (Mar 1994), 34-43.
		However, stack permutation operations are no less productive than register loads, stores and transfers in a RISC architecture, and due to their ability to move more than one word at a time, there is evidence that permutations are more productive than register loads and stores.
		Thus, a stack architecture could utilize a clock period for non-permutation instructions which would be a small fraction of that for a register machine, and a permutation unit should take about the same time for its operation as a RAM of the same size.
		The stack cache for a linear stack machine should be even more efficient, since 1) there are no stack frames or frame pointers; 2) all temporaries are handled the same--both named and unnamed temporaries; and 3) the space for each temporary is reclaimed immediately upon the use of its value (i.e., the cache is "self-cleaning").
	home.pipeline.com /~hbaker1/ForthStack.html (6051 words)

	`Structured Design' by Yourdon and Constantine
		Structured design is the art of designing the components of a system and the interrelationship between those components in the best possible way.
		Structured design is the process of deciding which components interconnected in which way will solve some well-specified problem.
		In the fully factored form, this structure involves at each level a single transformation or set of alternative transformations performed by subordinate transform modules, whose inputs are supplied by the last subordinate afferent modules (on the afferent side), or whose outputs are fed to the next subordinate efferent modules (on the efferent side).
	www.win.tue.nl /~wstomv/quotes/structured-design.html (6086 words)

	Structured Source Editing (SSE) Component Overview
		For Structured Text editors, the target id is generated based on the content type in the editor, type of editor, place to contribute.
		A structured document allows regions of the text to be set as "read-only" so that users can not simply type over something that is intended to remain as part of the document.
		Structured models are mostly interesting due to is extended types and implementers and exists as an abstraction to provide a consistent way to manage shared models and also to access its underlying structured document.
	www.eclipse.org /webtools/wst/components/sse/overview.html (1458 words)

	[No title]
		This exception will occur when the execution stack for the current thread overflows by having too many pending method calls, often the result of a highly recursive function or a stack frame that consumes a significant amount of stack space, such as one that uses the C# stackalloc keyword (corresponding to the MSIL localloc instruction).
		Most applications and libraries never attempt to address this problem, because it is very difficult to write code that can survive a stack overflow from every method call (handling stack overflows also requires part of the stack to be unwound, which means that finally blocks close to the overflow point may be skipped altogether).
		This method may probe for sufficient stack space and serves as a marker to the CLR, informing it that a CER is about to begin.
	msdn.microsoft.com /msdnmag/issues/05/10/Reliability/default.aspx (6954 words)

	Dr. Dobb's \| Planarity by Edge Addition \| April 1, 2005
		A graph is a data structure encountered frequently in algorithmics, whenever we must be able to represent a set of objects and relationships between pairs of objects.
		The vertices of a graph are typically depicted using points or small circles or squares, and each edge is drawn as a line or curve that connects to the two endpoint vertices of the edge.
		Interestingly, the issue of how to render a graph that has been found to be planar is typically treated as a separate problem, in part because the issue of what makes a good drawing is application-dependent; for example, a good layout for a circuit may not make a pleasing web site map rendition.
	www.ddj.com /184406070 (2624 words)

	SGLR: /home/jurgenv/glt/sglr-reject-postparse/src/gss/gss.c File Reference
		This file implements the construction and searching functions of the Graph Structured Stack (GSS) that are used during parsing by the SGLR algorithm.
		Searches for a GSS node, in the current level of the GSS, that is labelled with the specified state number.
		The list containing the target GSS nodes and tree nodes of each traversal are returned as a ReductionPath.
	homepages.cwi.nl /~jurgenv/test/html/d6/de3/gss_8c.html (593 words)

	The stack of specifications - Design Issues
		But as the stack of specifications gets higher and higher, and as electronic commerce, legally enforceable agreements, and socially sensitive issues such as privacy and fraud become matters of public concern, it is worth reiterating for the record.
		We have seen how any user of the Internet is bound to a series of specifications which define the meanings of terms, and hence allow his or her equipment and agents to interoperable with others.
		This stack prevents one from sending a nasty email to someone and then protesting that the message didn't mean anything.
	www.w3.org /DesignIssues/Stack (3776 words)

	Businessworld: An Introduction To Data Interpretation (Site not responding. Last check: 2007-10-12)
		However, the graphs are more vivid in depicting trends like growth, decline and plateaus.
		This ‘stack’ can be expressed in percentage as well, wherein all the players’ averages, in one year, add up to 100.
		Since the data is not in the form of a table or graph and is in an unprocessed form, you need to make it convenient to use.
	www.businessworld.in /cat/data.htm (1395 words)

	Overview of the MPEG-4 Standard
		For Scene graph API the objective is to provide access to the scene graph: to inspect the graph, to alter nodes and their fields, and to add and remove nodes within the graph.
		The results show that the average video quality achieved on the mobile channel is high, that the impact of errors is effectively kept local by the tools in MPEG-4 video, and that the video quality recovers quickly at the end of periods of error.
		An adaptation of SL-packetized streams must be specified to each transport protocol stack of interest according to these requirements and in conjunction with the standardization body that has the proper jurisdiction.
	library.n0i.net /graphics/mp-eg4_overview (17558 words)

	Freegraph Page @ Hunter-Lovell.org
		To zoom in, draw a box on the graph area with the mouse.
		Press the "Convert" button and the RPN stack will be displayed as a list.
		The algorithm used is from: Tanenbaum, Andrew S. Structured Computer Organization, 3rd ed.
	www.hunter-lovell.org /freegraph/freegraph.html (395 words)

	[No title]
		(3) Breadth-first search was used to handle non-determinism, and the parser's stack was generalized into a graph.
		THE GRAPH-STRUCTURED PARSING STACK: Assuming that the LR(k) parsing table has states numbered 0, 1,..., Q-1 (Q = 12 for the grammar in Example 1), where 0 is the starting state, the parsing stack for the sentence above will have layers numbered 0, 1,..., 8.
		Therefore, between any two vertices of the graph will lie at most ONE edge labeled by ONE node, e.g.
	www.cs.cmu.edu /~gap/junk/tom/tomita.ref (1255 words)

	Romanian Language Technology (Site not responding. Last check: 2007-10-12)
		These structured categories are indirectly specified, as constraints which must be satisfied.
		The lexical entries constrain the categories which may be the leafs of the parse tree, and the grammar's productions constrain the structured categories corresponding with a parent node and its immediate descendants.
		Tomita's algorithm [10] solves these problems gracefully with two devices, a graph structured stack and a packed shared parse forest.
	www.racai.ro /books/awde/ciocoiu.html (548 words)

	MEMORY ADDRESSING DEVICE USING ARBITRARY DIRECTED GRAPH STRUCTURE (US3614746)
		Data-processing system comprising an addressing device for addressing in a directed graph structure in a store which is divided for this purpose into tables each having a reference address as a table base.
		Relative to the table base, the words to be found numerically in the table are reference addresses for a further table or operands or indirect addresses for operands.
		In order to permit highly flexible addressing in a directed graph structure, the address portion of an instruction and/or any sequential words contains an arbitrary number of address components which may have different lengths.
	www.delphion.com /details?pn=US03614746__ (195 words)

	GELATO - LR Techniques for Parsing and Deduction (Site not responding. Last check: 2007-10-12)
		Several implementations of generalized LR parsing has been proposed, most of them using a graph-structured stack instead of a single stack in order to deal with multiple parses of a single sentence.
		However, generalized LR(1) and LALR(1) parsing algorithms for arbitrary context-free grammars can be derived, in a natural way, from the well known Earley's algorithm, preserving cubic time complexity in the worst case but performing better in the average case and attaining linear complexity in the case of LR grammars.
		That complexity is achieved by the use of dynamic programming to represent the non-deterministic evolution of the stack instead of graph-structured stack representations, as has often been the case in previous approaches
	coleweb.dc.fi.udc.es /gelato/lr.html (325 words)

	[No title]
		Existing work for query processing over graph data models often relies on pre-computing the transitive closure or path indexes.
		In this paper, we propose a family of stack-based algorithms to handle path, twig, and dag pattern queries for directed acyclic graphs (DAGs) in particular.
		Our algorithms do not precompute the transitive closure nor path indexes for a given graph, however they achieve an optimal runtime complexity quadratic in the average size of the query variable bindings.
	www.db.ucsd.edu:8080 /talks/li.txt (141 words)

	Manipulating Structured Data in Ruby > Working with Arrays (Site not responding. Last check: 2007-10-12)
		Other structures such as trees and graphs may be implemented in different ways according to the situation and the programmer's preference.
		This is sometimes useful, for example, in storing an undirected graph (as you'll see toward the end of this chapter).
		Here, we have chosen to implement the matrix so that the row number must be greater than or equal to the column number; we also could have coded it so that the same pair of indexes simply mapped to the same element.
	www.samspublishing.com /articles/article.asp?p=26943 (5697 words)

Try your search on: Qwika (all wikis)