Linear time parsers for classes of non context free languages

DOI10.1016/0304-3975(95)00231-6MaRDI QIDQ671525zbMATH OpenOpenAlexFDO

Authors Sulekha R. Kulkarni, Priti Shankar

Publication date 27 February 1997

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(95)00231-6

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of compilers and interpreters (68N20)

Recommendations

• Linear-time suffix parsing for deterministic languages
• scientific article; zbMATH DE number 1183241
• On parsing and condensing substrings of LR languages in linear time
• scientific article; zbMATH DE number 1452981
• A general context-free parsing algorithm running in linear time on every LR(k) grammar without using lookahead
• Bidirectional parsing for linear languages
• Linear parsing expression grammars
• Efficient parallel and incremental parsing of practical context-free languages
• scientific article; zbMATH DE number 2050920

Cites work

• scientific article; zbMATH DE number 3470007 (Why is no real title available?)
• A geometric hierarchy beyond context-free languages
• The equivalence of four extensions of context-free grammars
• Tree adjunct grammars
• Upper bounds on recognition of a hierarchy of non-context-free languages

Cited in

(8)

• scientific article; zbMATH DE number 1183241 (Why is no real title available?)
• Bidirectional parsing for linear languages
• scientific article; zbMATH DE number 2050920 (Why is no real title available?)
• scientific article; zbMATH DE number 1452981 (Why is no real title available?)
• A general context-free parsing algorithm running in linear time on every LR(k) grammar without using lookahead
• Linear-time suffix parsing for deterministic languages
• A non-left-to-right, non-directional parser for ambiguous lattices
• On the complexity of a mildly context-sensitive language class

This page was built for publication: Linear time parsers for classes of non context free languages

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