Linear-time suffix parsing for deterministic languages

DOI10.1145/233551.233555MaRDI QIDQ4371678zbMATH OpenOpenAlexFDO

Authors 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

deterministic context-free languagelinear-time algorithm

Mathematics Subject Classification ID

Theory of programming languages (68N15)

Recommendations

• Linear time parsers for classes of non context free languages
• On parsing and condensing substrings of LR languages in linear time
• scientific article; zbMATH DE number 1452981
• Suffix languages in Lr parsing
• LZ-End Parsing in Linear Time
• Synchronous context-free grammars and optimal linear parsing strategies
• Deterministic parsing for augmented context-free grammars
• scientific article; zbMATH DE number 2089362
• Complexity of suffix-free regular languages
• Complexity of suffix-free regular languages

Cited in

(8)

• Detecting useless transitions in pushdown automata
• String analysis as an abstract interpretation
• scientific article; zbMATH DE number 1962795 (Why is no real title available?)
• scientific article; zbMATH DE number 1452981 (Why is no real title available?)
• Detecting useless transitions in pushdown automata
• On parsing and condensing substrings of LR languages in linear time
• Linear time parsers for classes of non context free languages
• Fast parallel recognition of LR language suffixes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4371678)