right-to-left parser
Смотреть что такое "right-to-left parser" в других словарях:
Left recursion — In computer science, left recursion is a special case of recursion. In terms of context free grammar, a non terminal r is left recursive if the left most symbol in any of r’s ‘alternatives’ either immediately (direct left recursive) or through… … Wikipedia
Parser combinator — In functional programming, a parser combinator is a higher order function which accepts several parsers as input and returns a new parser as its output. In this context, a parser is a function accepting strings as input and returning some… … Wikipedia
Left corner — The left corner of a production rule in a context free grammar is the left most symbol on the right side of the rule.For example, in the rule A→Xα , X is the left corner.The left corner table associates a symbol with all possible left corners for … Wikipedia
GLR parser — In computer science, a GLR parser ( Generalized Left to right Rightmost derivation parser ) is an extension of an LR parser algorithm to handle nondeterministic and ambiguous grammars. First described in a 1986 paper by Masaru Tomita, it has also … Wikipedia
LR parser — In computer science, an LR parser is a parser for context free grammars that reads input from Left to right and produces a Rightmost derivation. The term LR( k ) parser is also used; here the k refers to the number of unconsumed look ahead input… … Wikipedia
Operator-precedence parser — An operator precedence parser is a bottom up parser that interprets an operator precedence grammar. For example, most calculators use operator precedence parsers to convert from the human readable infix notation with order of operations format… … Wikipedia
Tail recursive parser — Tail recursive parsers are derived from the more common Recursive descent parsers. Tail recursive parsers are commonly used to parse left recursive grammars. They use a smaller amount of stack space than regular recursive descent parsers. They… … Wikipedia
LALR parser — In computer science, a lookahead LR parser or LALR parser is a specialized form of LR parser that can deal with more context free grammars than Simple LR (SLR) parsers. It is a very popular type of parser because it gives a good trade off between … Wikipedia
LL parser — An LL parser is a top down parser for a subset of the context free grammars. It parses the input from Left to right, and constructs a Leftmost derivation of the sentence (hence LL, compared with LR parser). The class of grammars which are… … Wikipedia
Text Executive Programming Language — In 1979, Honeywell Information Systems announced a new programming language for their time sharing service named TEX, an acronym for the Text Executive processor. TEX was a first generation scripting language, developed around the time of AWK and … Wikipedia
LL(k)-Grammatik — Dieser Artikel setzt Vorkenntnisse im Bereich Theoretische Informatik und Compilerbau voraus. Eine LL(k) Grammatik (im Kontrast zu LF(k) Grammatik auch schwache LL(k) Grammatik) ist eine spezielle kontextfreie Grammatik, welche die Grundlage… … Deutsch Wikipedia
