 | 2007 |
|---|
| 27 |       | Eberhard Bertsch,
Mark-Jan Nederhof:
Some observations on LR-like parsing with delayed reduction.
Inf. Process. Lett. 104(6): 195-199 (2007) |
| 2005 |
|---|
| 26 | | Eberhard Bertsch,
Mark-Jan Nederhof:
Gap Parsing with LL(1) Grammars.
Grammars 8: 1-16 (2005) |
| 2004 |
|---|
| 25 | | Eberhard Bertsch,
Mark-Jan Nederhof:
Fast parallel recognition of LR language suffixes.
Inf. Process. Lett. 92(5): 225-229 (2004) |
| 2001 |
|---|
| 24 |  | Eberhard Bertsch,
Mark-Jan Nederhof:
On the Complexity of Some Extensions of RCG Parsing.
IWPT 2001 |
| 23 | | Eberhard Bertsch,
Mark-Jan Nederhof:
Size/lookahead tradeoff for LL(k)-grammars.
Inf. Process. Lett. 80(3): 125-129 (2001) |
| 1999 |
|---|
| 22 | | Eberhard Bertsch,
Mark-Jan Nederhof:
On Failure of the Pruning Technique in ``Error Repair in Shift-Reduce Parsers''.
ACM Trans. Program. Lang. Syst. 21(1): 1-10 (1999) |
| 21 | | Eberhard Bertsch:
Abstract Comparison of two Error Detection Techniques for Programming Languages.
Journal of Automata, Languages and Combinatorics 4(2): 77-86 (1999) |
| 20 | | Eberhard Bertsch,
Mark-Jan Nederhof:
Regular Closure of Deterministic Languages.
SIAM J. Comput. 29(1): 81-102 (1999) |
| 1996 |
|---|
| 19 | | Eberhard Bertsch:
An Observation on Suffix Redundancy in LL(1) Error Repair.
Acta Inf. 33(7): 631-639 (1996) |
| 18 | | Mark-Jan Nederhof,
Eberhard Bertsch:
Linear-Time Suffix Parsing for Deterministic Languages.
J. ACM 43(3): 524-554 (1996) |
| 1994 |
|---|
| 17 | | Eberhard Bertsch:
On the Relationship between Indexed Grammars and Logic Programs.
J. Log. Program. 18(1): 81-98 (1994) |
| 1992 |
|---|
| 16 | | Eberhard Bertsch:
Variation of Parsing Speed - a Case Study for Modula-2.
Elektronische Informationsverarbeitung und Kybernetik 28(1): 3-20 (1992) |
| 1990 |
|---|
| 15 | | Eberhard Bertsch:
Preservation of LL- and LR-properties in Flattened Grammars.
Elektronische Informationsverarbeitung und Kybernetik 26(8/9): 443-450 (1990) |
| 1986 |
|---|
| 14 | | Eberhard Bertsch:
Optimierte Auswertung von Begriffsassoziationen in einer logik-orientierten Abfragesprache.
Angewandte Informatik 28(2): 80-84 (1986) |
| 1985 |
|---|
| 13 | | Eberhard Bertsch:
Ein dynamisch zeit-optimierendes Abfragesystem für Textdateien auf der Grundlage der Logik-Programmierung.
Angewandte Informatik 27(4): 137-144 (1985) |
| 12 | | Eberhard Bertsch:
Language Description and Implementation Concepts of LITFAS (Language for Implications from Textual Files and Automic Sentence).
Elektronische Informationsverarbeitung und Kybernetik 21(12): 597-611 (1985) |
| 11 | | Eberhard Bertsch:
Optimization of Expression Syntax: an Experimental Approach.
Softw., Pract. Exper. 15(3): 269-276 (1985) |
| 1982 |
|---|
| 10 | | Eberhard Bertsch:
Modularer Mustervergleich im Rahmen prozeduraler Programmierung.
Fachtagung über Programmiersprachen 1982: 209-220 |
| 1977 |
|---|
| 9 | | Eberhard Bertsch:
The Storage Requirement in Precedence Parsing.
Commun. ACM 20(3): 192-194 (1977) |
| 1976 |
|---|
| 8 | | Eberhard Bertsch,
Angelika Müller-von Brochowski:
COMSKEE - Eine Sprache für Linguisten.
Fachtagung über Programmiersprachen 1976: 166-174 |
| 7 | | Eberhard Bertsch:
Surjectivity of Functors on Grammars.
Mathematical Systems Theory 9(4): 298-307 (1976) |
| 1975 |
|---|
| 6 | | Eberhard Bertsch:
Analyzing families of grammars.
Automata Theory and Formal Languages 1975: 284-288 |
| 5 | | Eberhard Bertsch:
Two Thoughts on Fast Recognition of Indexed Languages
Information and Control 29(4): 381-384 (1975) |
| 4 | | Eberhard Bertsch:
An Observation on Relative Parsing Time.
J. ACM 22(4): 493-498 (1975) |
| 1974 |
|---|
| 3 | | Eberhard Bertsch:
A Decidability Result for Sequential Grammars.
ICALP 1974: 577-583 |
| 1973 |
|---|
| 2 | | Eberhard Bertsch:
Some considerations about classes of mappings between contextfree derivation systems.
Automatentheorie und Formale Sprachen 1973: 278-283 |
| 1 | | Eberhard Bertsch:
A note on bascules.
Elektronische Informationsverarbeitung und Kybernetik 9(6): 323-326 (1973) |
Data released under the ODC-BY 1.0 license — See also our legal information page