Electronic Resource
Springer
BIT
9 (1969), S. 225-238
ISSN:
1572-9125
Keywords:
Context-free
;
language
;
top-down
;
lookahead
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract Properties of context-free languages and grammars permitting deterministic top-down recognition with bounded lookahead are discussed. In particular, it is shown that for eachk〉1 there are such languages requiring a lookahead of at leastk characters.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01946814
Permalink
|
Location |
Call Number |
Expected |
Availability |