Bernd Fischer, Carsten Hammer, and Werner Struckmann, "ALADIN: A scanner generator for incremental programming environments ", Software---Practice & Experience, vol. 22, no. 11, pp. 1011--1025, 1992. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
History-Sensitive Error Recovery - Wagner, Graham (1997) (Correct)
....The recovery is guided by existing mechanisms for lexical and syntactic analysis; the language designer is not required to provide additional specifications in order for error recovery and reporting to function. 3 The approach is compatible with existing approaches to incremental lexing [18], 19] and both deterministic [20] and nondeterministic [21] parsing. Errors are represented in a simple fashion: the invalid modifications are simply maintained as unincorporated edits. This suggests a presentation of errors that is at once trivial and powerful: the unincorporated edits are ....
Bernd Fischer, Carsten Hammer, and Werner Struckmann, "ALADIN: A scanner generator for incremental programming environments ", Software---Practice & Experience, vol. 22, no. 11, pp. 1011--1025, 1992.
General Incremental Lexical Analysis - Wagner, Graham (1997) (1 citation) (Correct)
....employed to incorporate a textual modification. PSG [Bahlke and Snelting 1986] permits either textual or structural modifications, but not both, and halts its incorporation of textual modifications at the first error it encounters, rather than continuing its analysis. Its lexical generator, Aladin [Fischer et al. 1992], produces incremental lexers that cannot use more than a single character of lookahead. The Pan system [Ballance et al. 1992] possesses truly incremental lexical analysis, in that an unlimited number of disjoint textual edits can be applied to the program between analyses, and lexing is then ....
FISCHER, B., HAMMER, C., AND STRUCKMANN, W. 1992. ALADIN: A scanner generator for incremental programming environments. Software---Practice & Experience 22, 11, 1011--1025.
On the Look-Ahead Problem in Lexical Analysis - Wuu Yang (1995) (Correct)
....accepting states are deleted temporarily, no cycles exist in the resulting graph. Therefore, the DFA is an FFA. The dynamic programming steps are performed for i = 1, 2, and 3. The A i arrays are shown in Figure 2(c) The maximum number of lookahead symbols is the maximum of A 3 [4, 4] A 3 [4, 5], A 3 [5, 4] and A 3 [5, 5] which is 4. In this example, 4 is the length of the accepting to accepting path 5 2 3 1 5. This means the scanner needs to look ahead at most 4 symbols in order to detect the end of a token. For the string acabbb , the scanner needs to look ahead four ....
....are deleted temporarily, no cycles exist in the resulting graph. Therefore, the DFA is an FFA. The dynamic programming steps are performed for i = 1, 2, and 3. The A i arrays are shown in Figure 2(c) The maximum number of lookahead symbols is the maximum of A 3 [4, 4] A 3 [4, 5] A 3 [5, 4], and A 3 [5, 5] which is 4. In this example, 4 is the length of the accepting to accepting path 5 2 3 1 5. This means the scanner needs to look ahead at most 4 symbols in order to detect the end of a token. For the string acabbb , the scanner needs to look ahead four symbols after the ....
[Article contains additional citation context not shown here]
Fischer, B., Hammer, C., and Struckmann, W., ALADIN: A scanner generator for incremental programming environments, Software---Practice and Experience 22(11) pp. 1011-1025 (November 1992).
Mealy Machines Are A Better Model Of Lexical Analyzers - Yang (1996) (Correct)
....They aim at handling only those tokens that are used in common programming languages. LexAGen [13] provides a graphic user interface for constructing scanners incrementally. Incremental generation of lexical analyzers is also discussed in [18] which did not address the lookahead problem. ALADIN [19] ignores the look ahead problem by adopting a multiple match rule, instead of the longest match rule. Incremental lexical analysis in Galaxy [20] did not take the look ahead problem into consideration; that algorithm is useful for languages that require at most 1 symbol look ahead. Our approach to ....
B. Fischer, C. Hammer, and W. Struckmann, ALADIN: A scanner generator for incremental programming environments, Software---Practice and Experience 22(11) pp. 1011-1025 (November 1992).
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC