Recognizing two-sided contexts in cubic time

DOI10.1007/978-3-319-06686-8_24MaRDI QIDQ4981169zbMATH OpenOpenAlexFDO

Authors Max Rabkin

Publication date 24 June 2014

Published in Computer Science - Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-06686-8_24

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Logic programming (68N17) Grammars and rewriting systems (68Q42)

Recommendations

• A recognition and parsing algorithm for arbitrary conjunctive grammars.
• Context-free recognition via shortest paths computation: a version of Valiant's algorithm
• Improved normal form for grammars with one-sided contexts
• scientific article; zbMATH DE number 1747449
• Grammars with two-sided contexts

Cited in

(6)

• Generalized LR parsing algorithm for grammars with one-sided contexts
• Improved normal form for grammars with one-sided contexts
• Two-sided context specifications in formal grammars
• Generalized LR parsing for grammars with contexts
• The hardest language for grammars with context operators
• Linear-space recognition for grammars with contexts

This page was built for publication: Recognizing two-sided contexts in cubic time

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