Abstract
Breadth-depth grammars [3] extend the context-free ones by allowing breadth-first derivations. Breadth-depth languages include the context-free ones and are recognized by monostatic (one-state) automata having a double-ended queue (dequeue) as their memory. Examples of breadth-depth grammars for compilation and scheduling problems are included to argue for their applicability. We define deterministic monostatic dequeue automata and investigate their languages. Main results are their incomparability with context-free deterministic languages and linear-time recognizability. We introduce the LL(1) grammars, as an extension of the classical top-down deterministically parsable context-free grammars, and we present a recursive descent parsing algorithm using a FIFO queue.
Work supported by ESPRIT Basic Research Actions “ASMICS” and by Ministero dell'Università e della Ricerca Scientifica e Tecnologica “MURST 60%”
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. Harrison, Introduction to formal Languages Theory, Addison-Wesley, 1978
J. E. Hopcroft, A. J. Korenjack, Simple deterministic Languages, Proc. 7th IEEE Symposium on Switching and Automata Theory, pp. 36–46, 1966
A. Cherubini et al., Deque Automata and Breadth-Depth Grammars, International Journal of Foundations of Computer Science, vol. 1, n. 3, pp. 219–232, World Scientific Publishing Company, 1990
L. Breveglieri, Breadth-Depth Grammars and Dequeue Automata: Characterization of Determinism and Complexity, Int. Rep. n. 90-021, Dept. of Electronics, Politecnico di Milano, 1990
A. Cherubini et al., QRT FIFO Automata, Breadth-first Grammars and their Relations, TCS, 1991
E. Allevi, A. Cherubini, S. Crespi-Reghizzi, Breadth-first Grammars and Queue Automata, in Mathematical Foundations of Computer Science, M. P. Chytil, L. Janiga, V. Koubek (eds.), Springer Verlag, LNCS 324, pp. 162–170, 1988
L. Breveglieri et al., Multi-Stack multi-Queue Grammars and their Languages, Int. Rep. n. 90-053, Dept. of Electronics, Politecnico di Milano, 1990
F. J. Brandenburg, On the Intersections of Stacks and Queues, TCS 58, pp. 69–80, 1988
D. J. Rosenkrantz, R. E. Stearns, Properties of deterministic Top-down Grammars, Information and Control, vol. 17, n. 3, pp. 226–256, 1970
B. Vauquelin, B. Franchi-Zannettacci, Automates à File, TCS 11, pp. 221–225, 1980
D. Hemmendinger, Specifying ADA Server Tasks with executable formal Grammars, IEEE TSE, vol. 16, n. 7, July, 1990
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Breveglieri, L., Citrini, C., Crespi-Reghizzi, S. (1991). Deterministic dequeue automata and LL(1) parsing of breadth-depth grammars. In: Budach, L. (eds) Fundamentals of Computation Theory. FCT 1991. Lecture Notes in Computer Science, vol 529. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54458-5_59
Download citation
DOI: https://doi.org/10.1007/3-540-54458-5_59
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54458-6
Online ISBN: 978-3-540-38391-8
eBook Packages: Springer Book Archive