The following pages link to Parsing expression grammars (Q3452254):
Displayed 20 items.
- On the incremental growth and shrinkage of LR goto-graphs (Q471185) (← links)
- A simple P-complete problem and its language-theoretic representations (Q616494) (← links)
- Trace-based verification of imperative programs with I/O (Q617977) (← links)
- A linear-time simulation of deterministic \(d\)-limited automata (Q832958) (← links)
- An on-the-fly grammar modification mechanism for composing and defining extensible languages (Q1749119) (← links)
- Ordered context-free grammars (Q2164734) (← links)
- Context-free grammars with lookahead (Q2232284) (← links)
- An extension of context-free grammars with one-sided context specifications (Q2252533) (← links)
- Recursive descent parsing for Boolean grammars (Q2641876) (← links)
- Silver: an extensible attribute grammar system (Q2653933) (← links)
- A New Method for Dependent Parsing (Q3000590) (← links)
- (Q5016369) (← links)
- Computing the Shortest String and the Edit-Distance for Parsing Expression Languages (Q5041248) (← links)
- Grammars for Indentation-Sensitive Parsing (Q5111260) (← links)
- Context-Freeness of Parsing Expression Languages is Undecidable (Q5384531) (← links)
- Linear Parsing Expression Grammars (Q5739004) (← links)
- A Verified LL(1) Parser Generator (Q5875434) (← links)
- The computational power of parsing expression grammars (Q5915559) (← links)
- Bidirectional grammars for machine-code decoding and encoding (Q5915877) (← links)
- Weak inverse neighborhoods of languages (Q6067327) (← links)