Parsing Techniques
From MaRDI portal
Publication:5386261
DOI10.1007/978-0-387-68954-8zbMath1138.68022MaRDI 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 parsing; deterministic parsing; linear-time substring parsing; non-Chomsky systems; parsing as intersection
68-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science
68N15: Theory of programming languages
68N20: Theory of compilers and interpreters
Related Items
Unnamed Item, Unnamed Item, Weighted Operator Precedence Languages, Detecting Useless Transitions in Pushdown Automata, Verification of programs with exceptions through operator precedence automata, Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages, On the incremental growth and shrinkage of LR goto-graphs, Model-checking structured context-free languages, Generalizing input-driven languages: theoretical and practical benefits, Operator precedence and the visibly pushdown property, Detecting useless transitions in pushdown automata, Symbolic weighted language models, quantitative parsing and automated music transcription, Beyond operator-precedence grammars and languages, Operator precedence temporal logic and model checking, Error-repair parsing schemata, Recognition is not parsing - SPPF-style parsing from cubic recognisers, A Practical Simulation Result for Two-Way Pushdown Automata, Operator Precedence Languages: Their Automata-Theoretic and Logic Characterization, Precedence Automata and Languages, Maximally-Polyvariant Partial Evaluation in Polynomial Time, Unnamed Item
