|
|||||
|
|
Notes on top-down languages |
|
| Authors: | R. Kurki-Suonio |
| Affiliation: | (1) University of Tampere, Tampere, Finland |
| 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. |
| Keywords: | Context-free language top-down lookahead |
| 本文献已被 SpringerLink 等数据库收录！ | |