Two Families of Languages Related to ALGOL
Journal of the ACM (JACM)
A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
Journal of the ACM (JACM)
Greibach Normal Form in Algebraically Complete Semirings
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Formal models for some features of programming languages
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Review of "The functional treatment of parsing" by René Leermakers. Kluwer Academic Publishers 1993.
Computational Linguistics
A generalized Greibach Normal Form for definite clause grammars
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
Identification in the Limit of k,l-Substitutable Context-Free Languages
ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
Applications of fuzzy languages and pictorial databases to decision support systems design
AFIPS '83 Proceedings of the May 16-19, 1983, national computer conference
An elementary proof of a generalization of double Greibach normal form
Information Processing Letters
Non-erasing variants of the Chomsky---Schützenberger theorem
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
On Using Semi-Dyck Sets To Analyse Coupled-Context-Free Languages
Fundamenta Informaticae
TOWARDS AN ALGEBRAIC THEORY OF CONTEXT-FREE LANGUAGES
Fundamenta Informaticae
| Hi-index | 0.00 |
The relationship between the set of productions of a context-free grammar and the corresponding set of defining equations is first pointed out. The closure operation on a matrix of strings is defined and this concept is used to formalize the solution to a set of linear equations. A procedure is then given for rewriting a context-free grammar in Greibach normal form, where the replacements string of each production begins with a terminal symbol. An additional procedure is given for rewriting the grammar so that each replacement string both begins and ends with a terminal symbol. Neither procedure requires the evaluation of regular begins and ends with a terminal symbol. Neither procedure requires the evaluation of regular expressions over the total vocabulary of the grammar, as is required by Greibach's procedure.