@article{CulikCohen:JCSS:1973,
    Abstract = {LR-regular grammars are defined similarly to Knuth's LR(k) grammars, with the following exception: arbitrarily long look-ahead is allowed before making a parsing decision during the bottom-up syntactical analysis; however, this look-ahead is restricted in that the essential ``look-ahead information'' can be represented by a finite number of regular sets, thus can be computed by a finite state machine. LR-regular grammars can be parsed deterministically in linear time by a rather simple two-scan algorithm. Efficient parsers are constructed for given LR-regular grammars. The family of LR-regular languages is studied; it properly includes the family of deterministic CF languages and has similar properties. Necessary and sufficient conditions for a grammar to be LR-regular are derived and then utilized for developing parser generation techniques for arbitrary grammars.},
    Author = {{\v C}ulik, Karel and Cohen, Rina},
    File = {LR-regular grammars—an extension of LR(k) grammars - Čulik, Cohen (0) (0) - a - a - r.pdf},
    ISSN = {0022-0000},
    Journal = {Journal of Computer and System Sciences},
    Number = {1},
    Pages = {66--96},
    Title = {{LR-regular grammars---an extension of LR(k) grammars}},
    URL = {http://www.sciencedirect.com/science/article/pii/S0022000073800509},
    Volume = {7},
    Year = {1973},
    bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/S0022000073800509},
    bdsk-url-2 = {http://dx.doi.org/10.1016/S0022-0000(73)80050-9},
    date-added = {2016-01-15 12:04:46 +0000},
    date-modified = {2016-01-29 14:46:23 +0000},
    doi = {10.1016/S0022-0000(73)80050-9}
}

@article{CulikCohen:JCSS:1973, Abstract = {LR-regular grammars are defined similarly to Knuth's LR(k) grammars, with the following exception: arbitrarily long look-ahead is allowed before making a parsing decision during the bottom-up syntactical analysis; however, this look-ahead is restricted in that the essential ``look-ahead information'' can be represented by a finite number of regular sets, thus can be computed by a finite state machine. LR-regular grammars can be parsed deterministically in linear time by a rather simple two-scan algorithm. Efficient parsers are constructed for given LR-regular grammars. The family of LR-regular languages is studied; it properly includes the family of deterministic CF languages and has similar properties. Necessary and sufficient conditions for a grammar to be LR-regular are derived and then utilized for developing parser generation techniques for arbitrary grammars.}, Author = {{\v C}ulik, Karel and Cohen, Rina}, File = {LR-regular grammars—an extension of LR(k) grammars - Čulik, Cohen (0) (0) - a - a - r.pdf}, ISSN = {0022-0000}, Journal = {Journal of Computer and System Sciences}, Number = {1}, Pages = {66--96}, Title = {{LR-regular grammars---an extension of LR(k) grammars}}, URL = {http://www.sciencedirect.com/science/article/pii/S0022000073800509}, Volume = {7}, Year = {1973}, bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/S0022000073800509}, bdsk-url-2 = {http://dx.doi.org/10.1016/S0022-0000(73)80050-9}, date-added = {2016-01-15 12:04:46 +0000}, date-modified = {2016-01-29 14:46:23 +0000}, doi = {10.1016/S0022-0000(73)80050-9} }