Faster access than browser!
15 relations: Ambiguous grammar, ASF+SDF Meta Environment, Breadth-first search, Comparison of parser generators, Compiler-compiler, CYK algorithm, Directed acyclic graph, DMS Software Reengineering Toolkit, Earley parser, GNU bison, LALR parser, LR parser, Masaru Tomita, Natural language, State transition table.
Ambiguous grammar
In computer science, an ambiguous grammar is a context-free grammar for which there exists a string that can have more than one leftmost derivation or parse tree, while an unambiguous grammar is a context-free grammar for which every valid string has a unique leftmost derivation or parse tree.
New!!: GLR parser and Ambiguous grammar · See more »
ASF+SDF Meta Environment
The ASF+SDF Meta-Environment is an IDE and toolset for interactive program analysis and transformation.
New!!: GLR parser and ASF+SDF Meta Environment · See more »
Breadth-first search
Breadth-first search (BFS) is an algorithm for traversing or searching tree or graph data structures.
New!!: GLR parser and Breadth-first search · See more »
Comparison of parser generators
This is a list of notable lexer generators and parser generators for various language classes.
New!!: GLR parser and Comparison of parser generators · See more »
Compiler-compiler
In computer science, a compiler-compiler or compiler generator is a programming tool that creates a parser, interpreter, or compiler from some form of formal description of a language and machine.
New!!: GLR parser and Compiler-compiler · See more »
CYK algorithm
In computer science, the Cocke–Younger–Kasami algorithm (alternatively called CYK, or CKY) is a parsing algorithm for context-free grammars, named after its inventors, John Cocke, Daniel Younger and Tadao Kasami.
New!!: GLR parser and CYK algorithm · See more »
Directed acyclic graph
In mathematics and computer science, a directed acyclic graph (DAG), is a finite directed graph with no directed cycles.
New!!: GLR parser and Directed acyclic graph · See more »
DMS Software Reengineering Toolkit
The DMS Software Reengineering Toolkit is a proprietary set of program transformation tools available for automating custom source program analysis, modification, translation or generation of software systems for arbitrary mixtures of source languages for large scale software systems.
New!!: GLR parser and DMS Software Reengineering Toolkit · See more »
Earley parser
In computer science, the Earley parser is an algorithm for parsing strings that belong to a given context-free language, though (depending on the variant) it may suffer problems with certain nullable grammars.
New!!: GLR parser and Earley parser · See more »
GNU bison
GNU bison, commonly known as Bison, is a parser generator that is part of the GNU Project.
New!!: GLR parser and GNU bison · See more »
LALR parser
In computer science, an LALR parser or Look-Ahead LR parser is a simplified version of a canonical LR parser, to parse (separate and analyze) a text according to a set of production rules specified by a formal grammar for a computer language.
New!!: GLR parser and LALR parser · See more »
LR parser
In computer science, LR parsers are a type of bottom-up parser that efficiently read deterministic context-free languages, in guaranteed linear time.
New!!: GLR parser and LR parser · See more »
Masaru Tomita
is a Japanese molecular biologist and computer scientist, best known as the director of the E-Cell simulation environment software and/or the inventor of GLR parser algorithm.
New!!: GLR parser and Masaru Tomita · See more »
Natural language
In neuropsychology, linguistics, and the philosophy of language, a natural language or ordinary language is any language that has evolved naturally in humans through use and repetition without conscious planning or premeditation.
New!!: GLR parser and Natural language · See more »
State transition table
In automata theory and sequential logic, a state transition table is a table showing what state (or states in the case of a nondeterministic finite automaton) a finite semiautomaton or finite state machine will move to, based on the current state and other inputs.
New!!: GLR parser and State transition table · See more »
Redirects here:
Generalized LR parser, Glr parser, Parallel parser, Parallel parsing, Tomita's Algorithm.
