Even faster generalized LR parsing

DOI10.1007/PL00013319zbMath0973.68107OpenAlexW1984007424MaRDI QIDQ5941744

R. Nigel Horspool, Jan Janoušek, John Aycock, Bořivoj Melichar

Publication date: 26 August 2001

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00013319

zbMATH Keywords

GLR parser

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Grammars and rewriting systems (68Q42)

Related Items (7)

Recognition is not parsing - SPPF-style parsing from cubic recognisers ⋮ Parallel \(LL\) parsing ⋮ Generalized LR parsing algorithm for grammars with one-sided contexts ⋮ A predictive bottom-up parser ⋮ BRNGLR: a cubic Tomita-style GLR parsing algorithm ⋮ GENERALIZED LR PARSING ALGORITHM FOR BOOLEAN GRAMMARS ⋮ On regular tree languages and deterministic pushdown automata

This page was built for publication: Even faster generalized LR parsing