The following pages link to Stephan Heilbrunner (Q802878):
Displaying 13 items.
- An efficient recognizer for the Boolean closure of context-free languages (Q802880) (← links)
- Tests for the LR-, LL-, and LC-regular conditions (Q1050124) (← links)
- The undecidability of the unification and matching problem for canonical theories (Q1077931) (← links)
- A parsing automata approach to LR theory (Q1157181) (← links)
- A technique for recursion removal based on string homomorphisms (Q1168071) (← links)
- On the definition of ELR(k) and ELL(k) grammars (Q1250707) (← links)
- (Q1822513) (redirect page) (← links)
- Truly prefix-correct chain-free LR(1) parsers (Q1822514) (← links)
- A metatheorem for undecidable properties of formal languages and its application to LRR and LLR grammars and languages (Q1837536) (← links)
- A direct complement construction for \(LR\)(1) grammars (Q1901717) (← links)
- (Q3340115) (← links)
- (Q3871942) (← links)
- (Q4131635) (← links)
