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
UPUG(Uniquely Parsable Unification Grammar)는 다음과 같은 특징을 가진 형식 문법입니다: (1) 역추적 없이 구문 분석이 수행되고, (2) 각 비단말 기호는 인수를 가질 수 있으며, 파생 및 구문 분석 프로세스는 Prolog에서와 같이 용어 통일을 수반합니다( 또는 논리 프로그래밍). UPUG의 프레임워크를 확장하여 병렬 구문 분석도 가능하도록 고유한 병렬 구문 분석 가능 통합 문법(UPPUG)을 새롭게 도입합니다. 우리는 UPPUG에서 병렬 및 순차 축소의 경우 모두 역추적 없이 구문 분석을 수행할 수 있음을 보여줍니다. 주어진 입력 문자열을 병렬 축소를 통해 입력 길이의 하위선형 단계 수로 구문 분석할 수 있는 UPPUG의 예를 제공합니다.
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.
부
Jia LEE, Kenichi MORITA, "Uniquely Parallel Parsable Unification Grammars" in IEICE TRANSACTIONS on Information,
vol. E84-D, no. 1, pp. 21-27, January 2001, doi: .
Abstract: A uniquely parsable unification grammar (UPUG) is a formal grammar with the following features: (1) parsing is performed without backtracking, and (2) each nonterminal symbol can have arguments, and derivation and parsing processes accompany unification of terms as in Prolog (or logic programming). We newly introduce a uniquely parallel parsable unification grammar (UPPUG) by extending the framework of a UPUG so that parallel parsing is also possible. We show that, in UPPUG, parsing can be done without backtracking in both cases of parallel and sequential reductions. We give examples of UPPUGs where a given input string can be parsed in sublinear number of steps of the length of the input by parallel reduction.
URL: https://global.ieice.org/en_transactions/information/10.1587/e84-d_1_21/_p
부
@ARTICLE{e84-d_1_21,
author={Jia LEE, Kenichi MORITA, },
journal={IEICE TRANSACTIONS on Information},
title={Uniquely Parallel Parsable Unification Grammars},
year={2001},
volume={E84-D},
number={1},
pages={21-27},
abstract={A uniquely parsable unification grammar (UPUG) is a formal grammar with the following features: (1) parsing is performed without backtracking, and (2) each nonterminal symbol can have arguments, and derivation and parsing processes accompany unification of terms as in Prolog (or logic programming). We newly introduce a uniquely parallel parsable unification grammar (UPPUG) by extending the framework of a UPUG so that parallel parsing is also possible. We show that, in UPPUG, parsing can be done without backtracking in both cases of parallel and sequential reductions. We give examples of UPPUGs where a given input string can be parsed in sublinear number of steps of the length of the input by parallel reduction.},
keywords={},
doi={},
ISSN={},
month={January},}
부
TY - JOUR
TI - Uniquely Parallel Parsable Unification Grammars
T2 - IEICE TRANSACTIONS on Information
SP - 21
EP - 27
AU - Jia LEE
AU - Kenichi MORITA
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E84-D
IS - 1
JA - IEICE TRANSACTIONS on Information
Y1 - January 2001
AB - A uniquely parsable unification grammar (UPUG) is a formal grammar with the following features: (1) parsing is performed without backtracking, and (2) each nonterminal symbol can have arguments, and derivation and parsing processes accompany unification of terms as in Prolog (or logic programming). We newly introduce a uniquely parallel parsable unification grammar (UPPUG) by extending the framework of a UPUG so that parallel parsing is also possible. We show that, in UPPUG, parsing can be done without backtracking in both cases of parallel and sequential reductions. We give examples of UPPUGs where a given input string can be parsed in sublinear number of steps of the length of the input by parallel reduction.
ER -