scientific article; zbMATH DE number 3470007
From MaRDI portal
Publication:4054657
Cited in
(12)- Parsing schemata and correctness of parsing algorithms
- Computing abstract decorations of parse forests using dynamic programming and algebraic power series
- Information flow in tabular interpretations for generalized push-down automata
- Some observations on LR-like parsing with delayed reduction
- Generalized LR parsing algorithm for grammars with one-sided contexts
- BRNGLR: a cubic Tomita-style GLR parsing algorithm
- String analysis as an abstract interpretation
- Generalized LR parsing for grammars with contexts
- Conjunctive and Boolean grammars: the true general case of the context-free grammars
- If the current clique algorithms are optimal, so is Valiant's parser
- Linear time parsers for classes of non context free languages
- Programmable program synthesis
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 Q4054657)
