 | 1996 |
|---|
| 12 |       | Stephan Heilbrunner:
A Direct Complement Construction for LR(1) Grammars.
Acta Inf. 33(8): 781-797 (1996) |
| 1991 |
|---|
| 11 | | Stephan Heilbrunner,
Lothar Schmitz:
An Efficient Recognizer for the Boolean Closure of Context-Free Languages.
Theor. Comput. Sci. 80(1): 53-75 (1991) |
| 1987 |
|---|
| 10 | | Stephan Heilbrunner,
Steffen Hölldobler:
The Undecidability of the Unification and Matching Problem for Canonical Theories.
Acta Inf. 24(2): 157-171 (1987) |
| 1985 |
|---|
| 9 | | Stephan Heilbrunner:
Truly Prefix-Correct Chain-Free LR (1) Parsers.
Acta Inf. 22(5): 499-536 (1985) |
| 1984 |
|---|
| 8 | | Stephan Heilbrunner,
Lothar Schmitz:
For Statements with Restricted Enumerations.
Symposium on Programming 1984: 145-154 |
| 1983 |
|---|
| 7 | | Stephan Heilbrunner,
Lutz Michael Wegner:
Formale Sprachbeschreibungen - ist eine Vereinheitlichung in Sicht?
Angewandte Informatik 25(3): 93-98 (1983) |
| 6 | | Stephan Heilbrunner:
Tests for the LR-, LL-, and LC-Regular Conditions.
J. Comput. Syst. Sci. 27(1): 1-13 (1983) |
| 5 | | Stephan Heilbrunner:
A Metatheorem for Undecidable Properties of Formal Languages and its Application to LRR and LLR Grammars and Languages.
Theor. Comput. Sci. 23: 49-68 (1983) |
| 1982 |
|---|
| 4 | | Stephan Heilbrunner,
Werner Pohlmann:
A Technique for Recursion Removal Based on String Homomorphisms.
Sci. Comput. Program. 2(1): 69-81 (1982) |
| 1981 |
|---|
| 3 | | Stephan Heilbrunner:
A Parsing Automata Approach to LR Theory.
Theor. Comput. Sci. 15: 117-157 (1981) |
| 1980 |
|---|
| 2 | | Stephan Heilbrunner:
An Algorithm for the Solution of Fixed-Point Equations for Infinite Words.
ITA 14(2): 131-141 (1980) |
| 1979 |
|---|
| 1 | | Stephan Heilbrunner:
On the Definition of ELR(k) and ELL(k) Grammars.
Acta Inf. 11: 169-176 (1979) |
