Pages that link to "Item:Q1239011"
From MaRDI portal
The following pages link to Economy of description by parsers, DPDA's, and PDA's (Q1239011):
Displaying 11 items.
- Lower bounds on the size of deterministic parsers (Q792100) (← links)
- Constructing a realtime deterministic pushdown automaton from a grammar (Q1051440) (← links)
- On LLP(k) parsers (Q1162825) (← links)
- A pushdown automaton or a context-free grammar - which is more economical? (Q1165026) (← links)
- Why it might pay to assume that languages are infinite (Q1353889) (← links)
- On the size of parsers and \(\text{LR}(k)\)-grammars (Q1575535) (← links)
- On the complexity and decidability of some problems involving shuffle (Q1706154) (← links)
- Syntax checking either way (Q2164743) (← links)
- IN MEMORIAM CHANDRA KINTALA (Q2909177) (← links)
- Some formal results about stratificational grammars and their relevance to linguistics (Q3968471) (← links)
- Syntax checking either way (Q6100187) (← links)
