|
| |
| | Graph-structured stack -- Facts, Info, and Encyclopedia article |
 | | In (The branch of engineering science that studies (with the aid of computers) computable processes and structures) computer science, a graph-structured stack is a (Click link for more info and facts about directed acyclic graph) directed acyclic graph where each directed (An established line of travel or access) path is a (An orderly pile) stack. | | | Another way to simulate nondeterminism would be to duplicate the stack as needed. | | | They are used in (Click link for more info and facts about parsing) parsing to efficiently simulate nondeterminism for (Click link for more info and facts about ambiguous grammars) ambiguous grammars. |
|
http://www.absoluteastronomy.com/encyclopedia/g/gr/graph-structured_stack.htm
(139 words)
|
|
| |
| | Structured Dagger: A Coordination Language for Message-Driven Programming |
| | The Structured Dagger language is defined by augmenting Charm with structured entry-methods, which specify pieces of computations (when-blocks) and dependences among computations and messages. | | | Structured Dagger allows easy expression of dependences among messages and computations and also among computations within the same object using when-blocks similar to Dagger and various structured constructs. | | | Structured Dagger has been developed on top of Charm and is portable across many MIMD machines, with or without shared memory. |
|
http://charm.cs.uiuc.edu/papers/StructDaggerEURO96.www
(3016 words)
|
|
| |
| | LR parsing |
| | 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. | | | All LR parsers use the same algorithm; they differ in the way the table is generated. | | | The algorithm proceeds by reading the current state from the top of the stack, and the next symbol from the input. |
|
http://www.logicalshift.demon.co.uk/unix/parse/lr.html
(502 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. | | | Our approach to structured design is based on a formal, though not (as yet) mathematical, theory of the complexity of computer systems and programs. | | | Structured design is the process of deciding which components interconnected in which way will solve some well-specified problem. |
|
http://www.win.tue.nl/~wstomv/quotes/structured-design.html
(6086 words)
|
|
| |
| | LR Parsing for Conjunctive Grammars - Okhotin (ResearchIndex) |
| | Abstract: The Generalized LR parsing algorithm for context-free grammars, introduced by Tomita in 1986, is a polynomial-time implementation of nondeterministic LR parsing that uses graph-structured stack to represent the contents of the nondeterministic parser's pushdown for all possible branches of computation at a single computation step. | | | It has been specifically developed as a solution for practical parsing tasks arising in computational linguistics, and indeed has proved itself to be very suitable... |
|
http://citeseer.ist.psu.edu/okhotin02lr.html
(515 words)
|
|
| |
| | Stack Computers: Appendix A -- A Survey of Computers with Hardware Stack Support |
| | The stacks were featured in the architectures to ease implementation of reentrancy, recursion, code sharing, program protection, and dynamic storage allocation in a multi-user environment. | | | This stack machine was implemented as a student project for a VLSI design course. | | | Stack instructions were used because they led to easy code generation, compact programs, and easily pipelined hardware. |
|
http://www.ece.cmu.edu/~koopman/stack_computers/appa.html
(6275 words)
|
|
| |
| | Graph Data Structures Uses - The best data resources online! |
| | The problem of developing efficient algorithms and data structures to solve graph theoretic problems on tightly-coupled MIMD comuters is addressed.^Several approaches to parallelizing a serial algorithm are examined. | | | The domain of graph data structures and algorithms is in some respects more complicated than that of... | | | Once animation libraries are available, we need to revise the implementation of the original data structures to support some animation capabilities. |
|
http://data.bigfatdirectory.net/index.php?k=graph-data-structures-uses
(829 words)
|
|
| |
| | CodeViz |
| | With a large input graph, the longest operation for the generation of the call graph is the reading of the input file. | | | To compare, to generate a small graph on the authors machine, it takes 4 seconds to read the input graph and 0.1 seconds to generate the output file. | | | As cobjdump is analysing a binary, it is highly unlikely the graph is wrong, it just will have no information on inline functions or macros. |
|
http://www.skynet.ie/~mel/projects/gengraph
(2487 words)
|
|
| |
| | John Regehr's Stack Bounding Page |
| | Accurate bounds on stack depth cannot be computed from source code for a number of reasons: | | | A whole-program analysis of stack depth taking interrupt masks into account, where these masks were computed using a context insensitive analysis. | | | Adding up the individual stack requirements of main() and all interrupts, a simple approach that tends to overestimate stack depth. |
|
http://www.cs.utah.edu/~regehr/stacktool
(917 words)
|
|
| |
| | CAD, Graph, Drawing and Modeling Tools for Linux |
| | GraphEd is a graph editor with support for graph grammars, graph layout algorithms and an interface for application. | | | All these new techniques are the result of a relational, object-oriented data structure as a basic concept of SISCAD--P. Ask support@SIS.Staedtler.DE for information of the full version. | | | An interactive graph visualiztion system: * Automatic layout algorithms for directed graphs (with edge crossing minimization and bend reduction) and trees. |
|
http://ubista.ubi.pt/~dfis-wg/linux/apps/free-2/linux_cad.html
(1556 words)
|
|
| |
| | AN LL(1) PARSER GENERATOR WITH LOOKAHEAD - LALL |
| | This stack is maintained by the parser as it assimilates the input sentences. | | | As input is read, the top of the stack is combined with the input token to index into the parse table. | | | This type of parsing is called all path parsing, because all paths are generated during the ambiguous portion of the grammar to prepare for an ambiguous sentence. |
|
http://www.gen7software.com/lall/lallthes.htm
(12495 words)
|
|
| |
| | Parsing Schemata |
| | As an example of structural similarity of parsers, despite differences in form and appearance, we show that the underlying parsing schemata of Earley's algorithm and Tomita's algorithm are virtually identical. | | | A parsing schema does not specify the data structures, control structures, and (in case of parallel processing) communication structures that are to be used by a parser. | | | A parsing schema specifies the types of intermediate results that can be computed by a parser, and the rules that allow to expand a given set of such results with new results. |
|
http://wwwhome.cs.utwente.nl/~sikkel/papers/phd
(461 words)
|
|
| |
| | directed acyclic graph: Information From Answers.com |
| | DAGs can be considered to be a generalization of trees in which certain subtrees can be shared by different parts of the tree. | | | Directed acyclic graphs have many important applications in computer science, including: | | | DAGs appear in models where it doesn't make sense for a vertex to have a path to itself; for example, if an edge u→v indicates that v is a part of u, such a path would indicate that u is a part of itself, which is impossible. |
|
http://www.answers.com/topic/directed-acyclic-graph
(465 words)
|
|
| |
| | Dictionary of Algorithms and Data Structures |
| | Data Structures and Algorithms is a wonderful site with illustrations, explanations, analysis, and code taking the student from arrays and lists through trees, graphs, and intractable problems. | | | This is a dictionary of algorithms, algorithmic techniques, data structures, archetypical problems, and related definitions. | | | We do not include algorithms particular to business data processing, communications, operating systems or distributed algorithms, programming languages, AI, graphics, or numerical analysis: it is tough enough covering "general" algorithms and data structures. |
|
http://www.nist.gov/dads
(595 words)
|
|
| |
| | Search Methods |
| | Such graphs are most suitable for problems for which tree structures are the natural representation for the solution, as opposed to a simple path. | | | In AND/OR graphs, nodes typically represent complete subproblems; the root node is the original problem to be solved, and the leaves are solved problems. | | | Games are a useful domain in which to study machine intelligence because they have clearly defined rules and goals, and highly-structured environments in which success or failure is clearly defined. |
|
http://www.cs.dartmouth.edu/~brd/Teaching/AI/Lectures/Summaries/search.html
(5909 words)
|
|
| |
| | aiSee Graph Layout Software: Application Examples |
| | The graph can then be interactively explored or printed with aiSee, which is included in the aiCall distribution package. | | | A web-based tool that accepts as input up to two PubMed queries, and returns as output a network graph based on user-specified node and edge selection properties. | | | It features high efficiency, modularity, support for large data instances and special support for processing recursively structured data — including built-in functionality for data visualization. |
|
http://www.aisee.com/apps
(748 words)
|
|
| |
| | Romanian Language Technology |
| | Tomita's algorithm [10] solves these problems gracefully with two devices, a graph structured stack and a packed shared parse forest. | | | Many modern linguistic theories, like "Lexical-Functional Grammar" [1], "Functional Unification Grammar" [2,3], "Generalized Phrase Structure Grammar" [4], "Unification Categorial Grammar" [5] and "Head-Driven Phrase Structure Grammar" [6] have replaced the atomic categories of context-free grammars with structured categories which contain the syntactic and semantic properties of groups of words. | | | The environment consists of a parser, a parse table generator, a lexical analyzer and a unifier. |
|
http://www.racai.ro/books/awde/ciocoiu.html
(548 words)
|
|
| |
| | The Deployment of Protocol Stack Components using Web Services |
| | SOAP is a lightweight XML-based protocol for exchange of structured data in a decentralized, distributed environment. | | | The protocol profiler, which is interposed between the data store and the protocol agent, orchestrates all data transformations to best adapt the multicast communication for the environment at hand. | | | For example, a system may implement a FIFO or a LIFO queuing algorithm in the end-system buffer. |
|
http://www.xmltraining.com/deployment-of-protocol-stack-components-using-web-services.html
(4644 words)
|
|
| |
| | PhD. Dissertation of Miguel A. Alonso Pardo |
| | These grammars generate the class of tree adjoining languages, which is equivalent to the class of languages generated by linear indexed grammars and other mildly context-sensitive formalisms. | | | Tree adjoining grammars are an extension of context-free grammars that use trees instead of productions as the primary representing structure and that are considered to be adequate to describe most of syntactic phenomena occurring in natural languages. | | | Strongly-driven 2-stack automata can be used to describe bottom-up, top-down or mixed parsing strategies for tree adjoining languages with respect to the recognition of the adjunctions. |
|
http://www.dc.fi.udc.es/~alonso/phd.html
(1950 words)
|
|
| |
| | Stack Computers: BIBLIOGRAPHY |
| | Keedy, J. (1978a) On the use of stacks in the evaluation of expressions. | | | Myamlin, A. and Smirnov, V. (1969) Computer with stack memory. | | | Couch, J. and Hamm, T. (1977) Semantic structures for efficient code generation on a stack machine. |
|
http://www.ece.cmu.edu/~koopman/stack_computers/bib.html
(2899 words)
|
|
| |
| | Identical Principles, Higher Layers: Modeling Web Services as Protocol Stack |
| | In many cases, layering not only is useful for structuring software systems and implementations, but also is reflected in the hardware world, with specialized hardware implementing the functionality of certain layers. | | | Basically, the idea can be deployed to arbitrary structures to be defined regardless of the programming language which is actually chosen for implementation. | | | In this paper, we argue that the layering approach well-known from networking protocol stacks is also a useful approach for structuring the Web Services architecture. |
|
http://dret.net/netdret/docs/wilde-xmleurope2004.html
(6838 words)
|
|
| |
| | GELATO - LR Techniques for Parsing and Deduction |
| | 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. | | | The resulting algorithm can be extended to logic-based grammatical, such as Definite Clause Grammar, recovering the context-free backbone of the grammar in order to build the finite-state engine which guide the parsing process and augmenting the tabulated pieces of information with logical terms. | | | If we consider LR parsing tables in which each entry can contain several actions, we obtain non-deterministic LR parsing, often known as generalized LR parsing. |
|
http://coleweb.dc.fi.udc.es/gelato/lr.html
(325 words)
|
|
| |
| | PastPEMS |
| | The generated class structures implement a number of design patterns to facilitate analysis and transformation of the term that is represented by the class structure. | | | We prove that the minimal unrolled graph is an adequate basis for performing bit-vector data flow analyses at a breakpoint. | | | Beyond the well known and researched problems of graph layout, large-scale data sets call for new approaches to navigation, and the provision of visual cues to support the user's awareness of their context or location within the data set. |
|
http://www.cwi.nl/htbin/sen1/twiki/bin/view/SEN1/PastPEMS
(12897 words)
|
|
| |
| | Your scene graph design - GameDev.Net Discussion Forums |
| | The actual functions that perform the collision tests use the spacial nature of the scene graph to determine which objects the given entity might be colliding with though, which allows them to eliminate a lot of objects from the collision testing. | | | While there is depth to it of course, it might only go 20 units back, while being 4000 units high and long for example. | | | I always know what's on the screen to a very high degree of accuracy, and the worst case scenario is that I might be trying to draw an object that's slightly off the edge of the screen. |
|
http://www.gamedev.net/community/forums/viewreply.asp?ID=1566903
(5398 words)
|
|
| |
| | Manipulating Structured Data in Ruby |
| | Historically, arrays are the earliest known and most widespread of the complex data structures. | | | Some of these are just special "views" of an array or hash; for example, stacks and queues can be implemented easily using arrays. | | | Every modern language supports more complex forms of structured data and also provides mechanisms for creating new abstract data types. |
|
http://www.informit.com/articles/article.asp?p=26943
(5703 words)
|
|
| |
| | Seminar: Graph Drawing Aesthetic Metrics |
| | Graph Drawing algorithms use and measure aesthetics in a purely computational manner, unrelated to human perception. | | | A Graph Drawing uses aesthetics to produce 'good' drawings of graphs. | | | This project attempts develop a set of metric formulae that mimic the human's perception of a graph drawing aesthetic. |
|
http://www.itee.uq.edu.au/~seminar/archive/sem-0022.html
(3699 words)
|
|
| |
| | The stack of specifications - Design Issues |
| | 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 means that to understand anything more about the packet means, you have to read another spec: the Internet Protocol (IP, RFC791). | | | So how does that computer know what to do with it? |
|
http://www.w3.org/DesignIssues/Stack
(3776 words)
|
|
| |
| | Statistics and Statistical Graphics Resources |
| | The Geometer's Sketchpad A geometry drawing package (Windows, MAC) which can be set up as a helper app for WWW courses. | | | AMOS 3.6 for Windows A program for Structural Equation models and Confirmatory Factor Analysis with a lovely graphical user interface -- draw a path diagram to specify your model! | | | Statistical power analysis software [Broken link] A comprehensive list of software for power analyses, with extensive notes, links, pointers to reviews. |
|
http://www.math.yorku.ca/SCS/StatResource.html
(7408 words)
|
|
| |
| | Comp.compilers: Responses to "Jay Earley and his algorithm" |
| | Kay, M. Algorithm Schemata and Data Structures in Syntactic Processing. | | | The structure of Shared Forests in Ambiguous Parsing. | | | Tomita, M. Graph-structured Stack and Natural Language Parsing. |
|
http://compilers.iecc.com/comparch/article/89-06-014
(1018 words)
|
|
| |
| | A structured channel borrowing scheme for dynamic load balancing in cellular networks |
| | The channel borrowing algorithm works on the demand graph in a bottom up fashion, satisfying the demands of the cells in each subsequent inner ring. | | | Markov chain models are developed for a hot cell and detailed simulation experiments are conducted to evaluate the performance of our load balancing scheme. | | | Comparison with an existing load balancing strategy under moderate and heavy teletraffic conditions, shows a performance improvement of 12% in terms of call blockade by our load balancing scheme. |
|
http://csdl2.computer.org/persagen/DLAbsToc.jsp?resourcePath=/dl/proceedings/&toc=comp/proceedings/icdcs/1997/7813/00/7813toc.xml&DOI=10.1109/ICDCS.1997.597878
(400 words)
|
|
| |
| | Comp.compilers: Parsing techniques |
| | Our paper in Theoretical Computer Science shows that LR parsers can be very simply expressed by means of recursive functions, | | | that inspect and modify the parse stack in order to implement error | | | conventionally implemented by means of a stack automaton. |
|
http://compilers.iecc.com/comparch/article/93-05-016
(501 words)
|
|
| |
| | Stephen Tse: Fjavac project |
| | The compiler uses Generalized LR (GLR, aka Tomita parsing) parsing and Ordered Context-Free Grammar (OCFG), allowing token scanning (lexing), grammar parsing (yaccing), type definitions, tree constructions, error reporting to be automatically constructed. | | | In particular, GLR handles shift-reduce and reduce-reduce conflicts by local search (using graph-structured stack and packed forest), while OCFG resolves associativity and precedence at the production rule level instead of the token level. |
|
http://www.cis.upenn.edu/~stse/javac
(226 words)
|
|
| |
| | Focus Models |
| | To interpret an anaphoric reference, the entities in the focus space on the top of the stack are considered first. | | | Figure 4b illustrates a discourse structure that the stack-based model is designed to handle. | | | Incorrect interpretations involving the temporal references in (6) and (7) are possible (using the co-reference relation with (6) and the modify relation with (7)), so those utterances must be skipped. |
|
http://www.cs.cmu.edu/afs/cs.cmu.edu/project/jair/pub/volume9/wiebe98a-html/node13.html
(588 words)
|
|
| |
| | [No title] |
| | None -> ((* must make a new stack node *) let rs:tStackNode = (makeStackNode glr !newState) in (* add it to active parsers *) (addTopmostParser glr rs); rs (* use new *)) in (* semantic value for this token *) let sval:tSemanticValue = match !prev with | | | !maxStackNodesAllocd) then (maxStackNodesAllocd := !numStackNodesAllocd;); (* (Printf.printf "(!!!) init stack node: num=%d max=%d\n" !numStackNodesAllocd !maxStackNodesAllocd); (flush stdout); *)); end and deinitStackNode (ths: tStackNode) : unit = begin (deallocSemanticValues ths); (* this is implicit in the C++ implementation because firstSib.sib * is an RCPtr in C++ *) (if (ths.firstSib.sib != cNULL_STACK_NODE) then ((decRefCt ths.firstSib.sib))); ths.firstSib.sib |
|
http://www.cs.berkeley.edu/~smcpeak/elkhound/sources/elkhound/ocaml/glr.ml
(390 words)
|
|
| |
| | Relation to probabilistic LR parsing |
| | A grammar is suitable for LR parsing if these transitions can be performed deterministically by considering only the next input and the contents of a shift-reduce stack. | | | Generalized LR parsing is an extension that allows parallel tracking of multiple state transitions and stack actions by using a graph-structured stack [Tomita1986]. | | | The item sets are known as the ``states'' of the LR parser. |
|
http://www.icsi.berkeley.edu/~stolcke/papers/cl95/node43.html
(785 words)
|
|
| |
| | List of data structures Article, Listdatastructures Information |
| | For a wider list of terms, see list of terms relating to algorithms and data structures. | | | Priority queue - sometimes implemented as a Heap, below | | | We take no responsibility for the content, accuracy and use of this article. |
|
http://www.anoca.org/tree/heap/list_of_data_structures.html
(68 words)
|
|
| |
| | [No title] |
| | state == state) { return node; } } return NULL; #endif } // print the graph-structured stack to a file, named according // to the current token number, in a format suitable for a // graph visualization tool of some sort void GLR::dumpGSS(int tokenNumber) const { FILE *dest = fopen(stringc | | | printed; // list of nodes to print; might intersect 'printed', in which case // such nodes should be discarded; initially contains all the active // parsers (tops of stacks) SObjList | | | // unfortunately, the graph applet needs a bit of work before it // is worthwhile to use this routinely (though it's great for // quickly verifying a single (small) parse) // // however, it's worth noting that the text output is not entirely // unreadable... |
|
http://www.cs.berkeley.edu/~smcpeak/elkhound/sources/elkhound/glr.cc
(2527 words)
|
|
| |
| | FPGA and Structured ASIC Journal |
| | A weekly e-mail newsletter from techfocus media (publishers of FPGA and Structured ASIC Journal) dedicated to the design and application of embedded systems and software. | | | Lucky for you, we are constantly on the job, reading all those releases, analyzing the trends, and providing you with something akin to CliffsNotes, abstracting the mayhem into the more manageable. | | | Plot lines that could reasonably be summarized in a few succinct paragraphs drag on through chapter after chapter of flowery, flowing, profitable prose. |
|
http://www.fpgajournal.com
(1786 words)
|
|
| |
| | class glrSymbolVertex |
| | This class is used internally by the parser during parsing. | | | is used to store all edges of the graph structured stack, which goes to one state vertex over one symbol. |
|
http://nlp.fi.muni.cz/projekty/glr/reference/glrSymbolVertex.html
(219 words)
|
|
| |
| | class glrNode |
| | It return the stored set of edges where this node is shared in the graph structured stack. | | | This function adds an edge to the set of stored edges. |
|
http://nlp.fi.muni.cz/projekty/glr/reference/glrNode.html
(332 words)
|
|
| |
| | International Workshop on Parsing Technologies 2001 |
| | Liviu-Virgil Ciortuz: On Compilation of the Quick-Check Filter for Feature Structure Unification. | | | José Fortes Gálvez, Jacques Farré: Generalized epsilon-Skip Discriminating-Reverse Parsing on Graph-Structured Stack. |
|
http://www.informatik.uni-trier.de/~ley/db/conf/iwpt/iwpt2001.html
(434 words)
|
|
| |
| | Title: Computational Linguistics |
| | Three Mechanisms of Parser Driving for Structure Disambiguation | | | Magical Number Seven Plus or Minus Two: Syntactic Structure Recognition in Japanese and English Sentences |
|
http://www.gelbukh.com/cicling/2001/Program.htm
(366 words)
|
|
| |
| | LIDOS BibTeX Database File acl88.bib |
| | @inproceedings{Tomita88AC, AUTHOR = {M. Tomita}, TITLE = {Graph-Structured Stack and Natural Language Parsing}, YEAR = 1988, BOOKTITLE = "Proc. | | | @inproceedings{Linebarger:88AC, AUTHOR = {M. Linebarger and D. Dahl and L. Hirschman and R. Passonneau}, TITLE = {Sentence Fragments Regular Structures}, YEAR = 1988, BOOKTITLE = "Proc. |
|
http://www.dfki.de/imedia/lidos/bibtex/acl88.html
(1436 words)
|
|
|
