Epsilon weak precedence grammars and languages
Masoud T. Milani, David A. Workman (1990)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “The behaviour of parsing time under grammar morphisms”
Epsilon weak precedence grammars and languages
Normal forms for phrase-structure grammars
Viliam Geffert (1991)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
The structure of index sets and reduced indexed grammars
R. Parchmann, J. Duske (1990)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Coordinated pair systems ; part I : Dyck works and classical pumping
A. Ehrenfeucht, H. J. Hoogeboom, G. Rozenberg (1986)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Pumping and pushdown machines
Kai Salomaa, D. Wood, Sheng Yu (1994)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Computing of graphs of relations using generative grammars
Dan A. Simovici (1980)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Repetitive strings are not context-free
Rockford Ross, Karl Winklmann (1982)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: