Eberhard Bertsch - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 30 from 30

2013

On LR Parsing with Selective DelaysEberhard Bertsch, Mark-Jan Nederhof, Sylvain Schmitz. CC 2013: 244-263 [doi]

2007

Some observations on LR-like parsing with delayed reductionEberhard Bertsch, Mark-Jan Nederhof. ipl, 104(6):195-199, 2007. [doi]

2005

Gap Parsing with LL(1) GrammarsEberhard Bertsch, Mark-Jan Nederhof. grammars, 8:1-16, 2005. [doi]

2004

Fast parallel recognition of LR language suffixesEberhard Bertsch, Mark-Jan Nederhof. ipl, 92(5):225-229, 2004. [doi]

2001

On the Complexity of Some Extensions of RCG ParsingEberhard Bertsch, Mark-Jan Nederhof. iwpt 2001:

Size/lookahead tradeoff for LL(k)-grammarsEberhard Bertsch, Mark-Jan Nederhof. ipl, 80(3):125-129, 2001. [doi]

1999

Abstract Comparison of two Error Detection Techniques for Programming LanguagesEberhard Bertsch. jalc, 4(2):77-86, 1999.

Regular Closure of Deterministic LanguagesEberhard Bertsch, Mark-Jan Nederhof. SICOMP, 29(1):81-102, 1999.

On Failure of the Pruning Technique in Error Repair in Shift-Reduce Parsers Eberhard Bertsch, Mark-Jan Nederhof. TOPLAS, 21(1):1-10, 1999. [doi]

1996

An Observation on Suffix Redundancy in LL(1) Error RepairEberhard Bertsch. ACTA, 33(7):631-639, 1996.

An innovative finite state concept for recognition and parsing of context-free languagesMark-Jan Nederhof, Eberhard Bertsch. nle, 2(4):381-382, 1996. [doi]

Linear-Time Suffix Parsing for Deterministic LanguagesMark-Jan Nederhof, Eberhard Bertsch. JACM, 43(3):524-554, 1996. [doi]

1994

On the Relationship between Indexed Grammars and Logic ProgramsEberhard Bertsch. jlp, 18(1):81-98, 1994.

1992

Variation of Parsing Speed - a Case Study for Modula-2Eberhard Bertsch. eik, 28(1):3-20, 1992.

Ähnlichkeit von Grammatiken - Ansätze und ErfahrungenEberhard Bertsch. In Johannes Buchmann 0001, Harald Ganzinger, Wolfgang J. Paul, editors, Informatik, Festschrift zum 60. Geburtstag von Günter Hotz. Volume 1 of Teubner-Texte zur Informatik, pages 41-53, Teubner / Springer, 1992. [doi]

1990

Preservation of LL- and LR-properties in Flattened GrammarsEberhard Bertsch. eik, 26(8/9):443-450, 1990.

1986

Optimierte Auswertung von Begriffsassoziationen in einer logik-orientierten AbfragespracheEberhard Bertsch. wi, 28(2):80-84, 1986.

1985

Ein dynamisch zeit-optimierendes Abfragesystem für Textdateien auf der Grundlage der Logik-ProgrammierungEberhard Bertsch. wi, 27(4):137-144, 1985.

Optimization of Expression Syntax: an Experimental ApproachEberhard Bertsch. SPE, 15(3):269-276, 1985.

Language Description and Implementation Concepts of LITFAS (Language for Implications from Textual Files and Automic Sentence)Eberhard Bertsch. eik, 21(12):597-611, 1985.

1982

Modularer Mustervergleich im Rahmen prozeduraler ProgrammierungEberhard Bertsch. programmier 1982: 209-220

1977

The Storage Requirement in Precedence ParsingEberhard Bertsch. CACM, 20(3):192-194, 1977.

1976

COMSKEE - Eine Sprache für LinguistenEberhard Bertsch, Angelika Müller-von Brochowski. programmier 1976: 166-174

Surjectivity of Functors on GrammarsEberhard Bertsch. mst, 9(4):298-307, 1976.

1975

Two Thoughts on Fast Recognition of Indexed LanguagesEberhard Bertsch. iandc, 29(4):381-384, December 1975.

Analyzing families of grammarsEberhard Bertsch. automata 1975: 284-288

An Observation on Relative Parsing TimeEberhard Bertsch. JACM, 22(4):493-498, 1975. [doi]

1974

A Decidability Result for Sequential GrammarsEberhard Bertsch. icalp 1974: 577-583

1973

Some considerations about classes of mappings between contextfree derivation systemsEberhard Bertsch. automata 1973: 278-283

A note on basculesEberhard Bertsch. eik, 9(6):323-326, 1973.

Sign in or sign up to see more results.

runs on WebDSL