Faster access than browser!
22 relations: ANTLR, Backtracking, Bottom-up parsing, Comparison of parser generators, Computer language, Computer science, Context-free grammar, Context-free language, Deterministic finite automaton, Deterministic pushdown automaton, Empty string, Exponential function, LALR parser, Left recursion, Lexical analysis, LR parser, Parse tree, Programming language, Recursive descent parser, Regular language, Top-down parsing, Yacc.
ANTLR
In computer-based language recognition, ANTLR (pronounced Antler), or Another Tool For Language Recognition, is a parser generator that uses LL(*) for parsing.
New!!: LL parser and ANTLR · See more »
Backtracking
Backtracking is a general algorithm for finding all (or some) solutions to some computational problems, notably constraint satisfaction problems, that incrementally builds candidates to the solutions, and abandons a candidate ("backtracks") as soon as it determines that the candidate cannot possibly be completed to a valid solution.
New!!: LL parser and Backtracking · See more »
Bottom-up parsing
In computer science, parsing reveals the grammatical structure of linear input text, as a first step in working out its meaning.
New!!: LL parser and Bottom-up parsing · See more »
Comparison of parser generators
This is a list of notable lexer generators and parser generators for various language classes.
New!!: LL parser and Comparison of parser generators · See more »
Computer language
A computer language is a method of communication with a computer.
New!!: LL parser and Computer language · See more »
Computer science
Computer science deals with the theoretical foundations of information and computation, together with practical techniques for the implementation and application of these foundations.
New!!: LL parser and Computer science · See more »
Context-free grammar
In formal language theory, a context-free grammar (CFG) is a certain type of formal grammar: a set of production rules that describe all possible strings in a given formal language.
New!!: LL parser and Context-free grammar · See more »
Context-free language
In formal language theory, a context-free language (CFL) is a language generated by a context-free grammar (CFG).
New!!: LL parser and Context-free language · See more »
Deterministic finite automaton
In the theory of computation, a branch of theoretical computer science, a deterministic finite automaton (DFA)—also known as a deterministic finite acceptor (DFA) and a deterministic finite state machine (DFSM) or a deterministic finite state automaton (DFSA)—is a finite-state machine that accepts or rejects strings of symbols and only produces a unique computation (or run) of the automaton for each input string.
New!!: LL parser and Deterministic finite automaton · See more »
Deterministic pushdown automaton
In automata theory, a deterministic pushdown automaton (DPDA or DPA) is a variation of the pushdown automaton.
New!!: LL parser and Deterministic pushdown automaton · See more »
Empty string
In formal language theory, the empty string, or empty word is the unique string of length zero.
New!!: LL parser and Empty string · See more »
Exponential function
In mathematics, an exponential function is a function of the form in which the argument occurs as an exponent.
New!!: LL parser and Exponential function · 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!!: LL parser and LALR parser · See more »
Left recursion
In the formal language theory of computer science, left recursion is a special case of recursion where a string is recognized as part of a language by the fact that it decomposes into a string from that same language (on the left) and a suffix (on the right).
New!!: LL parser and Left recursion · See more »
Lexical analysis
In computer science, lexical analysis, lexing or tokenization is the process of converting a sequence of characters (such as in a computer program or web page) into a sequence of tokens (strings with an assigned and thus identified meaning).
New!!: LL parser and Lexical analysis · 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!!: LL parser and LR parser · See more »
Parse tree
A parse tree or parsing tree or derivation tree or concrete syntax tree is an ordered, rooted tree that represents the syntactic structure of a string according to some context-free grammar.
New!!: LL parser and Parse tree · See more »
Programming language
A programming language is a formal language that specifies a set of instructions that can be used to produce various kinds of output.
New!!: LL parser and Programming language · See more »
Recursive descent parser
In computer science, a recursive descent parser is a kind of top-down parser built from a set of mutually recursive procedures (or a non-recursive equivalent) where each such procedure usually implements one of the productions of the grammar.
New!!: LL parser and Recursive descent parser · See more »
Regular language
In theoretical computer science and formal language theory, a regular language (also called a rational language) is a formal language that can be expressed using a regular expression, in the strict sense of the latter notion used in theoretical computer science (as opposed to many regular expressions engines provided by modern programming languages, which are augmented with features that allow recognition of languages that cannot be expressed by a classic regular expression).
New!!: LL parser and Regular language · See more »
Top-down parsing
In computer science, top-down parsing is a parsing strategy where one first looks at the highest level of the parse tree and works down the parse tree by using the rewriting rules of a formal grammar.
New!!: LL parser and Top-down parsing · See more »
Yacc
Yacc (Yet Another Compiler-Compiler) is a computer program for the Unix operating system developed by Stephen C. Johnson.
New!!: LL parser and Yacc · See more »
Redirects here:
LL Parsing table, LL parsing, LL(1), LL(1) language, LL(k), LL(k) parser, LL1, Left factoring.
References
[1] https://en.wikipedia.org/wiki/LL_parser
