Zobrazeno 1 - 10
of 62
pro vyhledávání: '"Eberhard Bertsch"'
Autor:
Claus-Peter Schnorr, Hermann Walter, Volker Claus, Wolffried Stucky, Hans-Peter Blatt, Otto Spaniol, Gerd Kaufholz, Rainer Kemp, Wolfgang Paul, Eberhard Bertsch, Herbert Kopp, Manfred Stadel, Ulrich Schmitt, Wolfgang Weidner, Wolfgang Gräber, Dung Huynh, Rockford Ross, Michael Breder, Klaus Estenfeld, Axel Pink, Jan Messerschmidt, Hans Simon, Bernd Becker, Rolf Strothmann, Peter Auler, Johannes Arz, Paul Molitor, Reiner Kolla, Thomas Kretschmer, Franz Josef Schmitt, Ursula Becker, Reiner Marzinkewitsch, Hans Georg Osthof, Uwe Sparmann, Jürgen Sellen, Joachim Hartmann, Yonggang Guan, Gisela Sparmann, Hongzhong Wu, Elmar Schömer, Thomas Burch, Björn Schieffer, Christoph Scholl, Frank Follert, Thomas Chadzelek, Frank Schulz, Jens Eckstein, Matthias Buck, Bin Zhu, Alexander Gamkrelidze, Jörg Sauer, Timo von Oertzen, Tobias Gärtner, Christopher Durst
Publikováno v:
Festschrift zum 90. Geburtstag von Prof. Dr. Dr. h.c. mult. Günter Hotz ISBN: 9783658378219
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::32e48b6842861657b3f0a0df274a2dcd
https://doi.org/10.1007/978-3-658-37822-6_1
https://doi.org/10.1007/978-3-658-37822-6_1
Autor:
Eberhard Bertsch
Publikováno v:
Blätter der DGVFM. 31:141-146
Autor:
Eberhard Bertsch
Publikováno v:
Blätter der DGVFM. 29:345-352
Autor:
Eberhard Bertsch, Mark-Jan Nederhof
Publikováno v:
Information Processing Letters. 104:195-199
We discuss a bottom-up parsing technique based on delayed reductions, and investigate its capabilities and limitations. Some non-LR(k) grammars, for any k, are handled deterministically by this method. Surprisingly, and counter-intuitively from the v
Publikováno v:
Blätter der DGVFM. 27:579-598
Autor:
Mark-Jan Nederhof, Eberhard Bertsch
Publikováno v:
Information Processing Letters. 80:125-129
For a family of languages a precise tradeoff relationship between the size of LL(k) grammars and the length k of lookahead is demonstrated.
Autor:
Eberhard Bertsch, Mark-Jan Nederhof
Publikováno v:
SIAM Journal on Computing. 29:81-102
We recall the notion of regular closure of classes of languages. We present two important results. The first result is that all languages which are in the regular closure of the class of deterministic (context-free) languages can be recognized in lin
Autor:
Eberhard Bertsch, Mark-Jan Nederhof
Publikováno v:
ACM Transactions on Programming Languages and Systems. 21:1-10
A previous article presented a technique to compute the least-cost error repair by incrementally generating configurations that result from inserting and deleting tokens a syntactically incorrect input. An additional mechanism to improve the run-time
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642370502
CC
Proceedings of CC 2013: 22nd International Conference on Compilers Construction
Compilers Construction
Compilers Construction, Mar 2013, Rome, Italy. pp.244--263, ⟨10.1007/978-3-642-37051-9_13⟩
CC
Proceedings of CC 2013: 22nd International Conference on Compilers Construction
Compilers Construction
Compilers Construction, Mar 2013, Rome, Italy. pp.244--263, ⟨10.1007/978-3-642-37051-9_13⟩
International audience; The paper investigates an extension of LR parsing that allows the delay of parsing decisions until a sufficient amount of context has been processed. We provide two characterizations for the resulting class of grammars, one ba
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::92a8f6466ed6f4c63fc851ef18a99405
https://doi.org/10.1007/978-3-642-37051-9_13
https://doi.org/10.1007/978-3-642-37051-9_13
Autor:
Eberhard Bertsch
Publikováno v:
Acta Informatica. 33:631-639
We give a simple grammatical characterization of the notion of suffix redundancy presented procedurally in a recent article by Fischer and Mauney. It is shown that certain properties of grammars related to suffix redundancy can be decided at parser g