Linear time parsers for classes of non context free languages

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

Priti Shankar, Sulekha R. Kulkarni

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)

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 (4)

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

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Efficient parallel and incremental parsing of practical context-free languages 👍 👎
• Bidirectional parsing for linear languages 👍 👎
• Linear-time suffix parsing for deterministic languages 👍 👎
• Linear Parsing Expression Grammars 👍 👎
• On parsing and condensing substrings of LR languages in linear time 👍 👎
• 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)