Recursive Ascent Parsing: From Earley to Marcus

@article{Leermakers1992RecursiveAP,
  title={Recursive Ascent Parsing: From Earley to Marcus},
  author={Ren{\'e} Leermakers},
  journal={Theor. Comput. Sci.},
  year={1992},
  volume={104},
  pages={299-312}
}
Leermakers, R., Recursive ascent parsing: from Earley to Marcus, Theoretical Computer Science 104 (1992) 299-3 12. An overview is given of recursive ascent parsing, a new functional implementation technique for parsers for context-free grammars. The theory behind it unifies the treatment of hitherto virtually unrelated parsing methods, such as the Earley algorithm and LR parsing. This is effected by banning the distinguishing factors, such as stacks and parsing tables: stacks are replaced by… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-7 of 7 references

A recursive ascent Earley parser , Inform

L. Augusteijn R. Leermakers, F. E. J. Kruseman Aretz
Process . Lett . • 1992

On a recursive ascent parser

F.E.J. Kruseman Aretz
Inform. Process. Lett • 1988

Similar Papers

Loading similar papers…