The family of languages generated by Boolean grammars and usable with recursive descent parsing is studied. It is demonstrated that Boolean LL languages over a unary alphabet are regular, while Boolean LL subsets of Σ* a* obey a certain periodicity property, which, in particular, makes the language {anb2n | n ≥ 0} nonrepresentable. It is also shown that {anbncs | n ≥ 0, s ∈ {a, b}} is not generated by any linear conjunctive LL grammar, while linear Boolean LL grammars cannot generate {anb nc* |n ≥S 0}.
| Original language | English |
|---|---|
| Title of host publication | Fundamentals of Computation Theory - 16th International Symposium, FCT 2007, Proceedings |
| Publisher | Springer Nature |
| Pages | 446-457 |
| Number of pages | 12 |
| ISBN (Print) | 9783540742395 |
| DOIs | |
| State | Published - 2007 |
| Externally published | Yes |
| Event | 16th International Symposium on Fundamentals of Computation Theory, FCT 2007 - Budapest, Hungary Duration: 27 Aug 2007 → 30 Aug 2007 |
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 4639 LNCS |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
| Conference | 16th International Symposium on Fundamentals of Computation Theory, FCT 2007 |
|---|---|
| Country/Territory | Hungary |
| City | Budapest |
| Period | 27/08/07 → 30/08/07 |
ID: 78926537