scientific article; zbMATH DE number 1452981

zbMATH Open0955.68067MaRDI QIDQ4955251

Heiko Goeman

Publication date: 25 May 2000

Title of this publication is not available (Why is that?)

zbMATH Keywords

LR parsersLR automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (2)

Linear time parsers for classes of non context free languages ⋮ Linear-time suffix parsing for deterministic languages

Recommendations

• Linear time parsers for classes of non context free languages 👍 👎
• On the reduction of \(LR(k)\) parsers 👍 👎
• Upper bounds on the size of LR(k) parsers 👍 👎
• On the size of parsers and \(\text{LR}(k)\)-grammars 👍 👎
• An LR substring parser applied in a parallel environment 👍 👎
• Relaxed Parsing of Regular Approximations of String-Embedded Languages 👍 👎
• On LR(k)-Parsers of Polynomial Size 👍 👎
• Linear-time suffix parsing for deterministic languages 👍 👎
• LZ-End Parsing in Linear Time 👍 👎
• On parsing and condensing substrings of LR languages in linear time 👍 👎

This page was built for publication:

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