Context-free ambiguity detection using multi-stack pushdown automata
From MaRDI portal
Recommendations
Cites work
- Analyzing Context-Free Grammars Using an Incremental SAT Solver
- Analyzing ambiguity of context-free grammars
- Bracketed context-free languages
- Budget-bounded model-checking pushdown systems
- Conservative Ambiguity Detection in Context-Free Grammars
- Detection of Generative Ambiguities in Context-Free Mechanical Languages
- Emptiness of Multi-pushdown Automata Is 2ETIME-Complete
- MULTI-PUSH-DOWN LANGUAGES AND GRAMMARS
- On the translation of languages from left to right
- Reachability of multistack pushdown systems with scope-bounded matching relations
- Scope-bounded multistack pushdown systems: fixed-point, sequentialization, and tree-width
- Tools and Algorithms for the Construction and Analysis of Systems
- Tools and Algorithms for the Construction and Analysis of Systems
- Top-down syntax nalysis
- Tracking down the origins of ambiguity in context-free grammars
Cited in
(4)
This page was built for publication: Context-free ambiguity detection using multi-stack pushdown automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2817371)