Linear time parsers for classes of non context free languages

DOI10.1016/0304-3975(95)00231-6zbMATH Open0872.68102OpenAlexW2146417340MaRDI QIDQ671525FDOQ671525

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

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

Mathematics Subject Classification ID

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

Cites Work

• A geometric hierarchy beyond context-free languages
• Tree adjunct grammars
• The equivalence of four extensions of context-free grammars
• Upper bounds on recognition of a hierarchy of non-context-free languages
• Title not available (Why is that?)

Cited In (8)

• A non-left-to-right, non-directional parser for ambiguous lattices
• Bidirectional parsing for linear languages
• Title not available (Why is that?)
• Linear-time suffix parsing for deterministic languages
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the complexity of a mildly context-sensitive language class
• A general context-free parsing algorithm running in linear time on every LR(k) grammar without using lookahead

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)