Digitale Medien
Springer
BIT
9 (1969), S. 225-238
ISSN:
1572-9125
Schlagwort(e):
Context-free
;
language
;
top-down
;
lookahead
Quelle:
Springer Online Journal Archives 1860-2000
Thema:
Mathematik
Notizen:
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.
Materialart:
Digitale Medien
URL:
http://dx.doi.org/10.1007/BF01946814
Permalink
|
Standort |
Signatur |
Erwartet |
Verfügbarkeit |
