The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Dans cet article, nous introduisons un transducteur d'arbre pushdown ascendant (b-PDTT) qui est un transducteur d'arbre ascendant avec stockage pushdown (où le stockage pushdown stocke les arbres) et peut être considéré comme un double concept de type descendant. transducteur d'arbre pushdown (t-PDTT). Après avoir prouvé certaines propriétés fondamentales du b-PDTT, par exemple, tout b-PDTT peut être réalisé par une pile linéaire à état unique et converti en forme normale de type G qui correspond à la forme normale de Greibach dans une grammaire sans contexte, et ainsi Ensuite, nous comparons la capacité de traduction d’un b-PDTT avec celle d’un t-PDTT.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copier
Katsunori YAMASAKI, Yoshichika SODESHIMA, "A Comparison of Bottom-Up Pushdown Tree Transducers and Top-Down Pushdown Tree Transducers" in IEICE TRANSACTIONS on Information,
vol. E85-D, no. 5, pp. 799-811, May 2002, doi: .
Abstract: In this paper we introduce a bottom-up pushdown tree transducer (b-PDTT) which is a bottom-up tree transducer with pushdown storage (where the pushdown storage stores the trees) and may be considered as a dual concept of the top-down pushdown tree transducer (t-PDTT). After proving some fundamental properties of b-PDTT, for example, any b-PDTT can be realized by a linear stack with single state and converted into G-type normal form which corresponds to Greibach normal form in a context-free grammar, and so on, we compare the translational capability of a b-PDTT with that of a t-PDTT.
URL: https://global.ieice.org/en_transactions/information/10.1587/e85-d_5_799/_p
Copier
@ARTICLE{e85-d_5_799,
author={Katsunori YAMASAKI, Yoshichika SODESHIMA, },
journal={IEICE TRANSACTIONS on Information},
title={A Comparison of Bottom-Up Pushdown Tree Transducers and Top-Down Pushdown Tree Transducers},
year={2002},
volume={E85-D},
number={5},
pages={799-811},
abstract={In this paper we introduce a bottom-up pushdown tree transducer (b-PDTT) which is a bottom-up tree transducer with pushdown storage (where the pushdown storage stores the trees) and may be considered as a dual concept of the top-down pushdown tree transducer (t-PDTT). After proving some fundamental properties of b-PDTT, for example, any b-PDTT can be realized by a linear stack with single state and converted into G-type normal form which corresponds to Greibach normal form in a context-free grammar, and so on, we compare the translational capability of a b-PDTT with that of a t-PDTT.},
keywords={},
doi={},
ISSN={},
month={May},}
Copier
TY - JOUR
TI - A Comparison of Bottom-Up Pushdown Tree Transducers and Top-Down Pushdown Tree Transducers
T2 - IEICE TRANSACTIONS on Information
SP - 799
EP - 811
AU - Katsunori YAMASAKI
AU - Yoshichika SODESHIMA
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E85-D
IS - 5
JA - IEICE TRANSACTIONS on Information
Y1 - May 2002
AB - In this paper we introduce a bottom-up pushdown tree transducer (b-PDTT) which is a bottom-up tree transducer with pushdown storage (where the pushdown storage stores the trees) and may be considered as a dual concept of the top-down pushdown tree transducer (t-PDTT). After proving some fundamental properties of b-PDTT, for example, any b-PDTT can be realized by a linear stack with single state and converted into G-type normal form which corresponds to Greibach normal form in a context-free grammar, and so on, we compare the translational capability of a b-PDTT with that of a t-PDTT.
ER -