Recursive Descent Parser
Top-down parsing, Backtracking, Context-free grammar
Herausgegeben: Gerhild, Theia Lucina
Versandkostenfrei!
Versandfertig in 6-10 Tagen
35,99 €
inkl. MwSt.
PAYBACK Punkte
18 °P sammeln!
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. A recursive descent parser is a 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 production rules of the grammar. Thus the structure of the resulting program closely mirrors that of the grammar it recognizes. A predictive parser is a recursive descent parser that does not require backtracking. Predictive parsing is possible only for the class of LL(k) grammars, whi...
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. A recursive descent parser is a 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 production rules of the grammar. Thus the structure of the resulting program closely mirrors that of the grammar it recognizes. A predictive parser is a recursive descent parser that does not require backtracking. Predictive parsing is possible only for the class of LL(k) grammars, which are the context-free grammars for which there exists some positive integer k that allows a recursive descent parser to decide which production to use by examining only the next k tokens of input. (The LL(k) grammars therefore exclude all ambiguous grammars, as well as all grammars that contain left recursion.
