Parsing Techniques
From MaRDI portal
Publication:5386261
DOI10.1007/978-0-387-68954-8zbMath1138.68022OpenAlexW4206078070MaRDI QIDQ5386261
Publication date: 23 April 2008
Published in: Monographs in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-0-387-68954-8
parallel parsingdeterministic parsinglinear-time substring parsingnon-Chomsky systemsparsing as intersection
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Theory of programming languages (68N15) Theory of compilers and interpreters (68N20)
Related Items (21)
Model-checking structured context-free languages ⋮ Maximally-Polyvariant Partial Evaluation in Polynomial Time ⋮ Recognition is not parsing - SPPF-style parsing from cubic recognisers ⋮ Symbolic weighted language models, quantitative parsing and automated music transcription ⋮ Operator Precedence Languages: Their Automata-Theoretic and Logic Characterization ⋮ Beyond operator-precedence grammars and languages ⋮ Verification of programs with exceptions through operator precedence automata ⋮ Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages ⋮ Generalizing input-driven languages: theoretical and practical benefits ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Operator precedence temporal logic and model checking ⋮ On the incremental growth and shrinkage of LR goto-graphs ⋮ Precedence Automata and Languages ⋮ Operator precedence and the visibly pushdown property ⋮ Detecting Useless Transitions in Pushdown Automata ⋮ Error-repair parsing schemata ⋮ Unnamed Item ⋮ Detecting useless transitions in pushdown automata ⋮ A Practical Simulation Result for Two-Way Pushdown Automata ⋮ Weighted Operator Precedence Languages
This page was built for publication: Parsing Techniques
