Reducing non-determinism in right nulled GLR parsers

DOI10.1007/s00236-004-0137-zzbMath1094.68045OpenAlexW1972669280MaRDI QIDQ1889858

Adrian Johnstone, Elizabeth A. Scott

Publication date: 13 December 2004

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

Full work available at URL: https://doi.org/10.1007/s00236-004-0137-z

zbMATH Keywords

parsing algorithm

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (6)

Relaxed Parsing of Regular Approximations of String-Embedded Languages ⋮ Recognition is not parsing - SPPF-style parsing from cubic recognisers ⋮ An experimental ambiguity detection tool ⋮ Generalized LR parsing algorithm for grammars with one-sided contexts ⋮ BRNGLR: a cubic Tomita-style GLR parsing algorithm ⋮ A New Method for Dependent Parsing

This page was built for publication: Reducing non-determinism in right nulled GLR parsers