Recommendations
- New developments in parsing technology. Selected papers based on the contribution to the 6th international workshop on parsing technology, IWPT 2000, Trento, Italy, February 23--25, 2000, and the 7th international workshop on parsing technology, IWPT 2001
- Recent advances in parsing technology
- scientific article; zbMATH DE number 972132
- scientific article; zbMATH DE number 194079
- scientific article; zbMATH DE number 444435
Cited in
(29)- 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
- ASF+SDF parsing tools applied to ELAN
- 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
- Temporal logic and model checking for operator precedence languages
- On the incremental growth and shrinkage of LR goto-graphs
- Higher-order operator precedence languages
- A first-order complete temporal logic for structured context-free languages
- Weighted operator precedence languages
- Parsing schemata for practical text analysis.
- 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
- An Earley-based universal error-correcting parser
- Cyclic operator precedence grammars for parallel parsing
- A proof theory of right-linear ( -)grammars via cyclic proofs
- Cyclic operator precedence grammars for improved parallel parsing
- LR parsing for strings with placeholders
- Three-valued minimal semantic parsing of Boolean grammars
- Model-checking structured context-free languages
This page was built for publication: Parsing Techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5386261)
