- Full text PDF available (8)
- This year (0)
- Last 5 years (1)
- Last 10 years (4)
Journals and Conferences
The relative parsing time of grammars belonging to a common family is investigated
We present a linear-time algorithm to decide for any fixed deterministic context-free language <italic>L</italic> and input string <italic>w</italic> whether <italic>w</italic>is a suffix of some string in <italic>L</italic>. In contrast to a previously published technique, the decision procedure may be extended to produce syntactic structures (parses)… (More)
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 efficiency of this algorithm by pruning some of the configurations was discussed as well. In this… (More)
Programming language developers are blessed with the availability of efficient, powerful tools for parser generation. But even with automated help, the implementation of a parser remains often overly complex. Although programs should convey an unambiguous meaning, the parsers produced for their syntax, specified by a context-free grammar, are most often… (More)
For a family of languages a precise tradeoff relationship between the size of LL(k) grammars and the length k of lookahead is demonstrated. 2001 Elsevier Science B.V. All rights reserved.
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 generation time. Some suggestions concerning efficiency of repair attempts conclude the article.