Eberhard Bertsch

According to our database, Eberhard Bertsch authored at least 30 papers between 1973 and 2013.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of five.

2013

On LR Parsing with Selective Delays.

Eberhard Bertsch, Mark-Jan Nederhof, Sylvain Schmitz

Proceedings of the Compiler Construction - 22nd International Conference, 2013

2007

Some observations on LR-like parsing with delayed reduction.

Eberhard Bertsch, Mark-Jan Nederhof

Inf. Process. Lett., 2007

2005

Gap Parsing with LL(1) Grammars.

Eberhard Bertsch, Mark-Jan Nederhof

Grammars, 2005

2004

Fast parallel recognition of LR language suffixes.

Eberhard Bertsch, Mark-Jan Nederhof

Inf. Process. Lett., 2004

2001

Size/lookahead tradeoff for LL(k)-grammars.

Eberhard Bertsch, Mark-Jan Nederhof

Inf. Process. Lett., 2001

On the Complexity of Some Extensions of RCG Parsing.

Eberhard Bertsch, Mark-Jan Nederhof

Proceedings of the Seventh International Workshop on Parsing Technologies (IWPT-2001), 2001

1999

On Failure of the Pruning Technique in "Error Repair in Shift-Reduce Parsers".

Eberhard Bertsch, Mark-Jan Nederhof

ACM Trans. Program. Lang. Syst., 1999

Regular Closure of Deterministic Languages.

Eberhard Bertsch, Mark-Jan Nederhof

SIAM J. Comput., 1999

Abstract Comparison of two Error Detection Techniques for Programming Languages.

Eberhard Bertsch

J. Autom. Lang. Comb., 1999

1996

An innovative finite state concept for recognition and parsing of context-free languages.

Mark-Jan Nederhof, Eberhard Bertsch

Nat. Lang. Eng., 1996

Linear-Time Suffix Parsing for Deterministic Languages.

Mark-Jan Nederhof, Eberhard Bertsch

J. ACM, 1996

An Observation on Suffix Redundancy in LL(1) Error Repair.

Eberhard Bertsch

Acta Informatica, 1996

1994

On the Relationship between Indexed Grammars and Logic Programs.

Eberhard Bertsch

J. Log. Program., 1994

1992

Variation of Parsing Speed - a Case Study for Modula-2.

Eberhard Bertsch

J. Inf. Process. Cybern., 1992

Ähnlichkeit von Grammatiken - Ansätze und Erfahrungen.

Eberhard Bertsch

Proceedings of the Informatik, Festschrift zum 60. Geburtstag von Günter Hotz, 1992

1990

Preservation of LL- and LR-properties in Flattened Grammars.

Eberhard Bertsch

J. Inf. Process. Cybern., 1990

1986

Optimierte Auswertung von Begriffsassoziationen in einer logik-orientierten Abfragesprache.

Eberhard Bertsch

Angew. Inform., 1986

1985

Ein dynamisch zeit-optimierendes Abfragesystem für Textdateien auf der Grundlage der Logik-Programmierung.

Eberhard Bertsch

Angew. Inform., 1985

Optimization of Expression Syntax: an Experimental Approach.

Eberhard Bertsch

Softw. Pract. Exp., 1985

Language Description and Implementation Concepts of LITFAS (Language for Implications from Textual Files and Automic Sentence).

Eberhard Bertsch

J. Inf. Process. Cybern., 1985

1982

Modularer Mustervergleich im Rahmen prozeduraler Programmierung.

Eberhard Bertsch

Proceedings of the Programmiersprachen und Programmentwicklung, 1982

1977

The Storage Requirement in Precedence Parsing.

Eberhard Bertsch

Commun. ACM, 1977

1976

Surjectivity of Functors on Grammars.

Eberhard Bertsch

Math. Syst. Theory, 1976

COMSKEE - Eine Sprache für Linguisten.

Eberhard Bertsch, Angelika Müller-von Brochowski

Proceedings of the Programmiersprachen, 1976

1975

Two Thoughts on Fast Recognition of Indexed Languages

Eberhard Bertsch

Inf. Control., December, 1975

An Observation on Relative Parsing Time.

Eberhard Bertsch

J. ACM, 1975

Analyzing families of grammars.

Eberhard Bertsch

Proceedings of the Automata Theory and Formal Languages, 1975

1974

A Decidability Result for Sequential Grammars.

Eberhard Bertsch

Proceedings of the Automata, Languages and Programming, 2nd Colloquium, University of Saarbrücken, Germany, July 29, 1974

1973

A note on bascules.

Eberhard Bertsch

J. Inf. Process. Cybern., 1973

Some considerations about classes of mappings between contextfree derivation systems.

Eberhard Bertsch

Proceedings of the 1. Fachtagung über Automatentheorie und Formale Sprachen, 1973