Properties of Deterministic Top Down Grammars

@article{Rosenkrantz1969PropertiesOD,
  title={Properties of Deterministic Top Down Grammars},
  author={Daniel J. Rosenkrantz and Richard Edwin Stearns},
  journal={Information and Control},
  year={1969},
  volume={17},
  pages={226-256}
}
The class of context free grammars that can be deterministically parsed in a top down manner with a fixed amount of look-ahead is investigated. These grammars, called LL(k) grammars where k is the amount of look-ahead are first defined and a procedure is given for determining if a context free grammar is LL(k) for a given value of k. It is shown that ε-rules can be eliminated from an LL(k) grammar, at the cost of increasing the value of k by one, and a description is given of a canonical… CONTINUE READING
Highly Cited
This paper has 124 citations. REVIEW CITATIONS

Topics

Statistics

051015'72'77'83'89'95'01'07'13
Citations per Year

124 Citations

Semantic Scholar estimates that this publication has 124 citations based on the available data.

See our FAQ for additional information.