Abstract
In this paper we will study the use of context-free grammars (CFGs) for the verification of tree structures. Because of the long history of the study of CFGs, parsing techniques for CFGs are well-established. The aim of this paper is to make use of those parsing techniques for the verification of tree structures. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Fujiyoshi, A. (2008). Combination of context-free grammars and tree automata for unranked and ranked trees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5148 LNCS, pp. 283–285). https://doi.org/10.1007/978-3-540-70844-5_29
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
