%
% GENERATED FROM https://www.coli.uni-saarland.de
%    by   : anonymous
%    IP   : coli2006.lst.uni-saarland.de
%    at   : Mon, 05 Feb 2024 15:43:07 +0100 GMT
%    
% Selection : Author: Eberhard_Bertsch
%




@Article{Bertsch_Nederhof:1999,
      AUTHOR = {Bertsch, Eberhard and Nederhof, Mark-Jan},
      TITLE = {On Failure of the Pruning Technique in Error Repair in Shift-Reduce Parsers},
      YEAR = {1999},
      JOURNAL = {ACM Transactions on Programming Languages and Systems (TOPLAS)},
      VOLUME = {21},
      NUMBER = {1},
      PAGES = {1-10},
      URL = {http://www.dfki.de/dfkibib/publications/docs/nederhof99d.ps.gz},
      ABSTRACT = {A previous article presented a technique to compute the least-cost error repair by incrementally generating congurations that result from inserting and deleting tokens in a syntactically incorrect input. An additional mechanism to improve the run-time efficiency of this algorithm by pruning some of the congurations was discussed as well. In this communication we show that the pruning mechanism may lead to suboptimal repairs or may block all repairs. Certain grammatical errors in a common construct of the Java programming language also lead to the above kind of failure.},
      ANNOTE = {COLIURL : Bertsch:1999:FPT.pdf Bertsch:1999:FPT.ps}
}

@Article{Bertsch_Nederhof:1999_1,
      AUTHOR = {Bertsch, Eberhard and Nederhof, Mark-Jan},
      TITLE = {Regular Closure of Deterministic Languages},
      YEAR = {1999},
      JOURNAL = {SIAM Journal on Computing},
      VOLUME = {29},
      NUMBER = {1},
      PAGES = {81-102},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof99c.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof99c.ps.gz},
      ABSTRACT = {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 linear time. This is a nontrivial result, since this closure contains many inherently ambiguous languages. The second result is that the class of deterministic languages is contained in the closure of the class of deterministic languages with the prefix property or, stated in an equivalent way, all LR(k) languages are in the regular closure of the class of LR(0) languages.},
      ANNOTE = {COLIURL : Bertsch:1999:RCD.pdf Bertsch:1999:RCD.ps}
}

@Article{Bertsch_Nederhof:2001,
      AUTHOR = {Bertsch, Eberhard and Nederhof, Mark-Jan},
      TITLE = {Size/ Lookahead Tradeoff for LL(k)-Grammars},
      YEAR = {2001},
      JOURNAL = {Information Processing Letters},
      VOLUME = {80},
      PAGES = {125-129},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof01d.ps.gz},
      ABSTRACT = {For a family of languages a precise tradeoff relationship between the size of LL(k) grammars and the length k of lookahead is demonstrated.},
      ANNOTE = {COLIURL : Bertsch:2001:SLT.pdf Bertsch:2001:SLT.ps}
}

@InProceedings{Bertsch_Nederhof:2001_1,
      AUTHOR = {Bertsch, Eberhard and Nederhof, Mark-Jan},
      TITLE = {On the Complexity of some Extensions of RCG Parsing},
      YEAR = {2001},
      BOOKTITLE = {Proceedings of the 7th International Workshop on Parsing Technologies (IWPT'01), October 17-19},
      PAGES = {66-77},
      ADDRESS = {Beijing, China},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof01c.ps.gz},
      ABSTRACT = {We consider the parsing problem for range concatenation grammars (RCGs). Two new applications of RCG parsing are studied. The first is the parsing of finite automata, the second is string-to-string transduction, with an extension of RCGs. We show that these problems are undecidable in general, but become tractable for subclasses of the formalism.},
      ANNOTE = {COLIURL : Bertsch:2001:CSE.pdf Bertsch:2001:CSE.ps}
}

@InCollection{Nederhof_Bertsch:1999,
      AUTHOR = {Nederhof, Mark-Jan and Bertsch, Eberhard},
      TITLE = {An Innovative Finite State Concept for Recognition and Parsing of Context-Free Languages},
      YEAR = {1999},
      BOOKTITLE = {Extended Finite State Models of Language},
      PAGES = {226-243},
      EDITOR = {Kornai, A.},
      ADDRESS = {Stanford},
      PUBLISHER = {Cambridge University Press},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nebe99.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nebe99.entry},
      ANNOTE = {COLIURL : Nederhof:1999:IFS.pdf Nederhof:1999:IFS.ps}
}