Pages that link to "Item:Q2411044"
From MaRDI portal
The following pages link to Generalized LR parsing algorithm for grammars with one-sided contexts (Q2411044):
Displaying 11 items.
- One-sided random context grammars (Q766166) (← links)
- A general context-free parsing algorithm running in linear time on every LR(k) grammar without using lookahead (Q805244) (← links)
- Generation of efficient LALR parsers for regular right part grammars (Q1058307) (← links)
- A ''yo-yo'' parsing algorithm for a large class of van Wijngaarden grammars (Q1203603) (← links)
- Linear-space recognition for grammars with contexts (Q1704576) (← links)
- LR parsing for LCFRS (Q1736827) (← links)
- LR parsing for conjunctive grammars (Q1850932) (← links)
- An extension of context-free grammars with one-sided context specifications (Q2252533) (← links)
- Two-sided context specifications in formal grammars (Q2354409) (← links)
- (Q3994200) (← links)
- The hardest language for grammars with context operators (Q6038689) (← links)