Recognition is not parsing - SPPF-style parsing from cubic recognisers
From MaRDI portal
Publication:2653934
DOI10.1016/j.scico.2009.07.001zbMath1187.68301OpenAlexW2078387594MaRDI QIDQ2653934
Adrian Johnstone, Elizabeth A. Scott
Publication date: 15 January 2010
Published in: Science of Computer Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.scico.2009.07.001
Uses Software
Cites Work
- Reducing non-determinism in right nulled GLR parsers
- BRNGLR: a cubic Tomita-style GLR parsing algorithm
- Proofs and pedagogy; science and systems: The Grammar Tool Box
- Efficient Computation of LALR(1) Look-Ahead Sets
- Compiler Construction
- Compiler Construction
- Parsing Techniques
- Recognition and parsing of context-free languages in time n3
- An efficient context-free parsing algorithm
- On the translation of languages from left to right
- Even faster generalized LR parsing
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item