Properties of deterministic top down grammars
From MaRDI portal
Recommendations
Cited in
(22)- Deterministic grammars and grammar morphisms
- Bounded query machines: on NP( ) and NPQUERY( )
- Run-time extensible deterministic top-down parsing
- Deterministic parsing with P colony automata
- On LC(0) grammars and languages
- Bidirectional parsing for linear languages
- scientific article; zbMATH DE number 3843162 (Why is no real title available?)
- scientific article; zbMATH DE number 3846897 (Why is no real title available?)
- scientific article; zbMATH DE number 3856438 (Why is no real title available?)
- Epsilon weak precedence grammars and languages
- scientific article; zbMATH DE number 3924162 (Why is no real title available?)
- LL(1) grammars and Sub-LL(1) grammars
- scientific article; zbMATH DE number 3956467 (Why is no real title available?)
- scientific article; zbMATH DE number 522856 (Why is no real title available?)
- On the Transformation of LL(k)-linear Grammars to LL(1)-linear
- Top-Down Deterministic Parsing of Languages Generated by CD Grammar Systems
- A Powerful LL(k) Covering Transformation
- A note on top-down deterministic languages
- Look-ahead on pushdowns
- Rediscovering pushdown machines
- Lower bounds on the size of deterministic parsers
- On the complexity of LL(k) testing
This page was built for publication: Properties of deterministic top down grammars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5402516)