Linear-time suffix parsing for deterministic languages

DOI10.1145/233551.233555zbMath0882.68022OpenAlexW2166714603MaRDI QIDQ4371678

Mark-Jan Nederhof, E. Bertsch

Publication date: 21 January 1998

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: http://www.acm.org/pubs/contents/journals/jacm/1996-43/

zbMATH Keywords

linear-time algorithmdeterministic context-free language

Mathematics Subject Classification ID

Theory of programming languages (68N15)

Related Items (4)

Fast parallel recognition of LR language suffixes ⋮ Detecting Useless Transitions in Pushdown Automata ⋮ Detecting useless transitions in pushdown automata ⋮ String Analysis as an Abstract Interpretation

This page was built for publication: Linear-time suffix parsing for deterministic languages