The following pages link to Unambiguous Boolean grammars (Q948095):
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)
- Unambiguous conjunctive grammars over a one-symbol alphabet (Q507593) (← links)
- Parsing Boolean grammars over a one-letter alphabet using online convolution (Q714852) (← links)
- Expressive power of \(\text{LL}(k)\) Boolean grammars (Q719251) (← links)
- Conjunctive grammars with restricted disjunction (Q974750) (← links)
- Linear-space recognition for grammars with contexts (Q1704576) (← links)
- An extension of context-free grammars with one-sided context specifications (Q2252533) (← links)
- Input-driven languages are linear conjunctive (Q2634670) (← links)
- BOOLEAN GRAMMARS AND GSM MAPPINGS (Q3056280) (← links)
- Comparing Linear Conjunctive Languages to Subfamilies of the Context-Free Languages (Q3075534) (← links)
- Conjunctive Grammars with Restricted Disjunction (Q3599090) (← links)
- Computing the Shortest String and the Edit-Distance for Parsing Expression Languages (Q5041248) (← links)
