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
본 논문에서는 푸시다운 저장소(푸시다운 저장소가 트리를 저장하는 곳)를 갖춘 상향식 트리 변환기인 상향식 푸시다운 트리 변환기(b-PDTT)를 소개하며 하향식의 이중 개념으로 간주될 수 있습니다. 푸시다운 트리 변환기(t-PDTT). 예를 들어, b-PDTT의 몇 가지 기본 속성을 증명한 후 모든 b-PDTT는 단일 상태의 선형 스택으로 실현될 수 있으며 문맥 자유 문법에서 Greibach 정규 형식에 해당하는 G 유형 정규 형식으로 변환될 수 있습니다. 이어서 b-PDTT의 번역 능력과 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.
부
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
부
@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},}
부
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 -