A New Top-Down Parsing Algorithm to Accommodate Ambiguity and Left Recursion in Polynomial Time

Frost, R. A., & Hafiz, R. (2006). A New Top-Down Parsing Algorithm to Accommodate Ambiguity and Left Recursion in Polynomial Time. ACM SIGPLAN Notices, 41(5), 46-54.

Type

Journal article

Intellectual base

Primary research

Year

2006

DOI

10.1145/1149982.1149988

Link

https://doi.org/10.1145/1149982.1149988

Cited by

1 citation across 1 artifact.

Domain-specific

• Left Recursion
  • In standard notation, a nonterminal A is left-recursive when A derives, in one or more steps, A followed by some sequence α. The recurrence may be direct, as in A → A α, or indirect through a cycle of other nonterminals and nullable prefixes.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:ffcd89c9d054 · see in the full table