Expressive Power of LL(k) Boolean Grammars
Abstract: The family of languages generated by Boolean grammars and usable with the 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 {a
Search citation statements
Paper Sections
Select...
Citation Types
0
0
0
Publication Types
Select...
3
Relationship
0
3
Authors
Journals
Cited by 3 publications
References 12 publications
0
0
0
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
