Deterministic parsing of ambiguous grammars
From MaRDI portal
Publication:4065004
Cited in
(11)- An experimental ambiguity detection tool
- Mathematical typography
- Resolution of ambiguity in parsing
- Looping LR parsers
- A characterization ofLL(1) grammars
- Grammar coverings of a deterministic parser with action conflicts
- Context-free relations and their characteristics
- Integrating code generation and peephole optimization
- On conservative extensions of syntax in system development
- Precedences in specifications and implementations of programming languages
- Two iteration theorems for the LL(k) languages
This page was built for publication: Deterministic parsing of ambiguous grammars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4065004)