Eberhard Bertsch

30 papers A* 1B 1Journal 22Unranked 5

Year	Rank	Type	Title / Venue / Authors
2013	B	`conf`	On LR Parsing with Selective Delays. CC Eberhard Bertsch, Mark-Jan Nederhof, Sylvain Schmitz
2007	J	`jnl`	Some observations on LR-like parsing with delayed reduction. Inf. Process. Lett. Eberhard Bertsch, Mark-Jan Nederhof
2005	J	`jnl`	Gap Parsing with LL(1) Grammars. Grammars Eberhard Bertsch, Mark-Jan Nederhof
2004	J	`jnl`	Fast parallel recognition of LR language suffixes. Inf. Process. Lett. Eberhard Bertsch, Mark-Jan Nederhof
2001	—	`conf`	On the Complexity of Some Extensions of RCG Parsing. IWPT Eberhard Bertsch, Mark-Jan Nederhof
2001	J	`jnl`	Size/lookahead tradeoff for LL(k)-grammars. Inf. Process. Lett. Eberhard Bertsch, Mark-Jan Nederhof
1999	J	`jnl`	Abstract Comparison of two Error Detection Techniques for Programming Languages. J. Autom. Lang. Comb. Eberhard Bertsch
1999	J	`jnl`	On Failure of the Pruning Technique in "Error Repair in Shift-Reduce Parsers". ACM Trans. Program. Lang. Syst. Eberhard Bertsch, Mark-Jan Nederhof
1999	J	`jnl`	Regular Closure of Deterministic Languages. SIAM J. Comput. Eberhard Bertsch, Mark-Jan Nederhof
1996	J	`jnl`	An Observation on Suffix Redundancy in LL(1) Error Repair. Acta Informatica Eberhard Bertsch
1996	J	`jnl`	An innovative finite state concept for recognition and parsing of context-free languages. Nat. Lang. Eng. Mark-Jan Nederhof, Eberhard Bertsch
1996	J	`jnl`	Linear-Time Suffix Parsing for Deterministic Languages. J. ACM Mark-Jan Nederhof, Eberhard Bertsch
1994	J	`jnl`	On the Relationship between Indexed Grammars and Logic Programs. J. Log. Program. Eberhard Bertsch
1992	J	`jnl`	Variation of Parsing Speed - a Case Study for Modula-2. J. Inf. Process. Cybern. Eberhard Bertsch
1992	—	`ch.`	Ähnlichkeit von Grammatiken - Ansätze und Erfahrungen. Informatik Eberhard Bertsch
1990	J	`jnl`	Preservation of LL- and LR-properties in Flattened Grammars. J. Inf. Process. Cybern. Eberhard Bertsch
1986	J	`jnl`	Optimierte Auswertung von Begriffsassoziationen in einer logik-orientierten Abfragesprache. Angew. Inform. Eberhard Bertsch
1985	J	`jnl`	Ein dynamisch zeit-optimierendes Abfragesystem für Textdateien auf der Grundlage der Logik-Programmierung. Angew. Inform. Eberhard Bertsch
1985	J	`jnl`	Language Description and Implementation Concepts of LITFAS (Language for Implications from Textual Files and Automic Sentence). J. Inf. Process. Cybern. Eberhard Bertsch
1985	J	`jnl`	Optimization of Expression Syntax: an Experimental Approach. Softw. Pract. Exp. Eberhard Bertsch
1982	—	`conf`	Modularer Mustervergleich im Rahmen prozeduraler Programmierung. Fachtagung über Programmiersprachen Eberhard Bertsch
1977	J	`jnl`	The Storage Requirement in Precedence Parsing. Commun. ACM Eberhard Bertsch
1976	—	`conf`	COMSKEE - Eine Sprache für Linguisten. Fachtagung über Programmiersprachen Eberhard Bertsch, Angelika Müller-von Brochowski
1976	J	`jnl`	Surjectivity of Functors on Grammars. Math. Syst. Theory Eberhard Bertsch
1975	J	`jnl`	An Observation on Relative Parsing Time. J. ACM Eberhard Bertsch
1975	—	`conf`	Analyzing families of grammars. Automata Theory and Formal Languages Eberhard Bertsch
1975	J	`jnl`	Two Thoughts on Fast Recognition of Indexed Languages Inf. Control. Eberhard Bertsch
1974	A*	`conf`	A Decidability Result for Sequential Grammars. ICALP Eberhard Bertsch
1973	J	`jnl`	A note on bascules. J. Inf. Process. Cybern. Eberhard Bertsch
1973	—	`conf`	Some considerations about classes of mappings between contextfree derivation systems. Automatentheorie und Formale Sprachen Eberhard Bertsch