Pages that link to "Item:Q2641876"
From MaRDI portal
The following pages link to Recursive descent parsing for Boolean grammars (Q2641876):
Displaying 13 items.
- Parsing by matrix multiplication generalized to Boolean grammars (Q385966) (← links)
- Conjunctive and Boolean grammars: the true general case of the context-free grammars (Q394967) (← links)
- A simple P-complete problem and its language-theoretic representations (Q616494) (← links)
- One-nonterminal conjunctive grammars over a unary alphabet (Q639852) (← links)
- Expressive power of \(\text{LL}(k)\) Boolean grammars (Q719251) (← links)
- Language equations with complementation: expressive power (Q764318) (← links)
- An efficient recognizer for the Boolean closure of context-free languages (Q802880) (← links)
- Unambiguous Boolean grammars (Q948095) (← links)
- Conjunctive grammars with restricted disjunction (Q974750) (← links)
- An extension of context-free grammars with one-sided context specifications (Q2252533) (← links)
- BOOLEAN GRAMMARS AND GSM MAPPINGS (Q3056280) (← links)
- (Q5422294) (← links)
- Developments in Language Theory (Q5473686) (← links)