[17] A. Warth, J. R. Douglass, and T. Millstein. Packrat parsers can support left recursion. In PEPM 2008, pages 103{110. ACM, 2008.
[6] J. Earley. An ecient context-free parsing algorithm. Commun. ACM, 13(2):94{102, 1970.
[11] G. Hutton and E. Meijer. Monadic parser combinators. Technical Report NOTTCS-TR-96-4, Department of Computer Science, University of Nottingham, 1996.
[1] R. Becket and Z. Somogyi. DCGs + Memoing = Packrat parsing, but is it worth it? In Practical Aspects of Declarative Languages, volume LNCS 4902, pages 182{196. Springer, Jan. 2008.
[7] B. Ford. Packrat parsing: simple, powerful, lazy, linear time, functional pearl. In ICFP 2002, volume 37/9, pages 36{47. ACM, 2002.
[4] J. Brant and D. Roberts. SmaCC, a Smalltalk Compiler-Compiler. http://www.refactory.com/Software/SmaCC/.
[5] M. Bravenboer and E. Visser. Parse table composition. In Software Language Engineering, volume LNCS 5452, pages 74{94. Springer, 2009.
[18] A. Warth and I. Piumarta. OMeta: an object-oriented language for pattern matching. In DLS 2007, pages 11{19. ACM, 2007.
[10] J. Heering, P. Klint, and J. Rekers. Incremental generation of parsers. In PLDI 1989, pages 179{191. ACM, 1989.