Nawrocki, J.R., Conflict detection and resolution in a lexical analyzer generator, Information Processing Letters 38 pp. 323-328 (1991).  Home/Search   Document Not in Database   Summary   Related Articles   Check

....way as Alex does. It allows two character look ahead and employs special LookAheadStates to solve the problem. With appropriate modifications to the continuation, action, and output tables, the new scanner discussed in this paper may solve the right context problem without re scanning. Nawrocki [15] solves a problem similar to that of Alex and LexAGen by checking the left context derived from the LALR grammars of the programming languages. GLA [8] does not address the lookahead problem; backtracking is not allowed. Rex [7] uses a tunnel automaton for efficient scanner generation. It does not ....

Nawrocki, J.R., Conflict detection and resolution in a lexical analyzer generator, Information Processing Letters 38 pp. 323-328 (1991).

....[9] introduces the if followed by operator. This operator actually changes the longest match convention. Alex does not allow look ahead in the general sense. LexAGen [13] which is similar to Alex, allows two character look ahead and employs special LookAheadStates to solve the problem. Nawrocki [14] solves a problem similar to that of Alex and LexAGen by checking the left context derived from the LALR grammars of the programming languages. GLA [15] does not address the look ahead problem; backtracking is not allowed. Rex [16] which uses a tunnel automaton for efficient scanner generation, ....

J.R. Nawrocki, Conflict detection and resolution in a lexical analyzer generator, Information Processing Letters 38 pp. 323-328 (1991).

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