Towards Efficient, Typed LR Parsers
Open Access
- 1 March 2006
- journal article
- research article
- Published by Elsevier in Electronic Notes in Theoretical Computer Science
- Vol. 148 (2) , 155-180
- https://doi.org/10.1016/j.entcs.2005.11.044
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Certifying Compilation for a Language with Stack AllocationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- Polymorphic typed defunctionalization and concretizationHigher-Order and Symbolic Computation, 2006
- Stratified type inference for generalized algebraic data typesPublished by Association for Computing Machinery (ACM) ,2006
- Types for describing coordinated data structuresPublished by Association for Computing Machinery (ACM) ,2005
- Languages of the futurePublished by Association for Computing Machinery (ACM) ,2004
- Guarded recursive datatype constructorsPublished by Association for Computing Machinery (ACM) ,2003
- Very fast YACC-compatible parsers (for very little effort)Software: Practice and Experience, 1998
- Objective ML: An effective object-oriented extension to MLTheory and Practice of Object Systems, 1998
- Even faster lr parsingSoftware: Practice and Experience, 1990
- Very fast LR parsingPublished by Association for Computing Machinery (ACM) ,1986