On regular tree languages and deterministic pushdown automata

被引：10

作者：

Janousek, Jan ^{[1
]}

Melichar, Borivoj ^{[2
]}

机构：

[1] Czech Tech Univ, Dept Comp Sci, Fac Informat Technol, Prague 16000 6, Czech Republic

[2] Czech Tech Univ, Dept Comp Sci & Engn, Fac Elect Engn, Prague 12135 2, Czech Republic

来源：

ACTA INFORMATICA | 2009年 / 46卷 / 07期

关键词：

39;

D O I：

10.1007/s00236-009-0104-9

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

The theory of formal string languages and of formal tree languages are both important parts of the theory of formal languages. Regular tree languages are recognized by finite tree automata. Trees in their postfix notation can be seen as strings. This paper presents a simple transformation from any given (bottom-up) finite tree automaton recognizing a regular tree language to a deterministic pushdown automaton accepting the same tree language in postfix notation. The resulting deterministic pushdown automaton can be implemented easily by an existing parser generator because it is constructed for an LR(0) grammar, and its size directly corresponds to the size of the deterministic finite tree automaton. The class of regular tree languages in postfix notation is a proper subclass of deterministic context-free string languages. Moreover, the class of tree languages which are in their postfix notation deterministic context-free string languages is a proper superclass of the class of regular tree languages.

引用

页码：533 / 547

页数：15

共 37 条

[1]

Aho A. V., 1972, The Theory of Parsing, Translation, and Compiling

[2]

Aho Alfred V., 2006, Compilers: Principles, Techniques, and Tools, V2nd

[3]

ALBLAS H, 1991, LNCS, V545

[4]

Alur R., 2004, P 36 ANN ACM S THEOR, P202, DOI [DOI 10.1145/1007352.1007390, 10.1145/1007352.1007390]

[5]

[Anonymous], 26 ACM SIGMOD SIGACT

[6] Even faster generalized LR parsing [J].

Aycock, J ;

Horspool, N ;

Janousek, J ;

Melichar, B .

ACTA INFORMATICA, 2001, 37 (09) :633-651

[7]

CHASE D, 1987, P 14 ANN ACM S PRINC, P168, DOI DOI 10.1145/41625.41640

[8]

Cleophas L. G. W. A., 2008, THESIS TU EINDHOVEN

[9]

Comon H., 2008, Tree Automata Techniques and Applications

[10]

Crochemore M., 1997, Handbook of Formal Languages, P399, DOI [10.1007/978-3-662-07675-0_9, DOI 10.1007/978-3-662-07675-0_9]

← 1 2 3 4 →