[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Wikipedia

User:Quale/Recursive-descent parsing

< User:Quale

In computer science, recursive descent is a top-down parsing technique that employs mutually-recursive procedures to analyze sentences in a context-free grammar. Each procedure processes one grammatical category, and has a clause for each production rule in the category (nonterminal). The procedures call each other recursively to process the nonterminals in the grammar so the structure of the resulting recursive-descent parser mirrors the organization of the grammar.[1] Recursive descent is a LL parsing technique, since it processes top-down, left-to-right, producing the leftmost derivation.

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 exclude all ambiguous grammars, as well as all grammars that contain left recursion. Any context-free grammar can be transformed into an equivalent grammar that has no left recursion, but removal of left recursion does not always yield an LL(k) grammar.[citation needed] A predictive parser runs in linear time.[citation needed]

Recursive descent with backtracking is a more general technique that determines which production to use by trying each production in turn.[2] Recursive descent with backtracking can parse some ambiguous grammars, but left recursion can still cause the parser to enter an infinite loop and fail to terminate.[3] Although this is a larger class than the LL(k) grammars, backtracking recursive descent parsers are not guaranteed to terminate unless the grammar is LL(k).[citation needed] Backtracking may require exponential time[citation needed] and can introduce a great deal of overhead, as semantic actions such as adding entries to the symbol table may need to be undone.[3] Backtracking also makes meaningful error reporting difficult, as there is little information to indicate where the error occurred.[3] As a consequence, recursive descent with backtracking is usually considered impractical for use in programming language compilers, and the term "recursive descent" is often used to mean a predictive parser.[citation needed]

Recursive descent is a simple parsing technique, but it is sufficient to parse most common computer programming languages and given a suitable grammar or syntax diagrams the parsers are easy to write by hand. Although it is possible to use a tool to generate recursive-descent parsers from a grammar description, most automatically-generated parsers use more powerful techniques. Despite this, recursive-descent parsers are popular because they allow convenient expression of semantic routines that derive meaning from the input and permit issuing high quality error diagnostics for syntactically invalid input.

History and applications

edit
  • early history, Irons, Foster
  • Algol 60
  • most programming languages in the early 1970s used recursive descent or operator precedence or both[4]
  • Pascal and subsequent Wirth 1-pass compilers
  • BCPL[5]
  • Cfront used yacc but Stroustrup thinks recursive descent would have been better
  • lcc, gcc, clang

Technique

edit
  • Wirth, Algorithms + Data Structures = Programs - from EBNF or syntax diagrams
  • Burge, Recursive Programming Techniques - backtracking parser written in a functional language
  • I have at least one more source detailing an explicit algorithm to write an r-d parser from an LL(1) grammar
  • possible to use explicit stack handling if implementing in a language without recursion such as FORTRAN before Fortran 90, usually not required today

Theory and practice

edit
  • LL(k), LL(1)
  • factoring to remove left recursion, may change associativity (EBNF usually gives an easy fix)
  • substitution
  • Fraser and Hanson technique to parse expressions that reduces the number of procedures required for languages with many precedence levels such as C

Left recursion

edit

Left recursion can be removed from any grammar, although the transformation may be involved and can introduce ε-productions.[6] Most cases of left recursion encountered in programming languages are immediate (have the form A → Aα).[citation needed]

A left recursive grammar for simple expressions:

E → E + T | T
T → T * F | F
F → ( E ) | number

Replace the E and T productions as follows[6]

E → T E′
E′ → + T | ε
T → F T′
T′ → * F | ε
F → ( E ) | number

This changes the associativity of the grammar, naturally producing right-associative parse trees.[citation needed] If the grammar is written in EBNF it is easy to maintain left associativity and to write the parse functions using loops rather than recursion[citation needed]

E → T { + E }*
T → F { * F }*

{α}* is zero or more repetitions of α, defined as[citation needed]

astar → astar α | ε

Left factoring

edit
A → αβ | αγ

If the input begins with a non-empty string derived from α there is no way to choose whether to expand αβ or αγ. Factor the common prefixes

A → αA′
A′ → β | γ

Programming language example. A common grammar for the conditional statement is

if_statement → if condition then statement else statement
  | if condition then statement

Upon encountering the token if a top-down parser cannot predict which expansion to use. Factor the common prefix

if_statement → if condition then statement if_tail
if_tail   → else statement | ε

where ε is the empty string. (Recursive-descent parsers choose an epsilon production only if the input does not match any non-empty productions.) [7]

Error recovery

edit

most methods delete symbols to reach a synchronization point

  • Wirth
  • Turner
  • lcc, Fraser and Hanson
  • good discussion of error recovery in Crafting a Compiler, Fischer and LeBlanc, if only I could find my copy

Comparison to other techniques

edit

Pros

edit
  • simple, can be written by hand
  • fast if no backtracking needed
  • good error messages[8]
  • easy to attach semantic routines
  • can handle ambiguity w/ ad hoc code[9]

Cons

edit
  • some grammars are most naturally expressed using left recursion and must be rewritten to be LL
  • many context-free grammars are not LL(k) for any finite k, LL(k) grammars are a subset of LR and LR is strictly more powerful
  • if using a parser generator, LR table-driven techniques can parse more languages

Although predictive parsers are widely used, and are frequently chosen if writing a parser by hand, programmers often prefer to use a table-based parser produced by a parser generator, either for an LL(k) language or using an alternative parser, such as LALR or LR. This is particularly the case if a grammar is not in LL(k) form, as transforming the grammar to LL to make it suitable for predictive parsing is involved. Predictive parsers can also be automatically generated, using tools like ANTLR.

Predictive parsers can be depicted using transition diagrams for each non-terminal symbol where the edges between the initial and the final states are labelled by the symbols (terminals and non-terminals) of the right side of the production rule.[10]

Notes

edit
  1. ^ Burge, W.H. (1975). Recursive Programming Techniques. ISBN 0-201-14450-6.
  2. ^ Cooper & Torczon 2012, p. 97.
  3. ^ a b c Aho & Ullman 1977, p. 177.
  4. ^ Aho & Ullman (1977), p. 145, citing McClure (1972).
  5. ^ Richards & Whitby-Stevens (1981), p. 100.
  6. ^ a b Aho & Ullman (1977), p. 177–179.
  7. ^ Aho & Ullman (1977), p. 182.
  8. ^ Cooper & Torczon 2012, p. 155.
  9. ^ Cooper & Torczon 2012, p. 109.
  10. ^ Aho, Sethi & Ullman 1986, p. 183.

References

edit
Retrieved from "https://en.wikipedia.org/w/index.php?title=User:Quale/Recursive-descent_parsing&oldid=729876494"