• Journal of KIISE:Software and Applications
• /
• v.37 no.1
• /
• pp.51-53
• /
• 2010

Extended PLR grammars are a large subclass of LR grammars and have good property of LL grammars. On the other hand, a testing algorithm of extended PLR grammars has not been given. The paper presents an algorithm for the testing of extended PLR grammars.

• Journal of KIISE:Software and Applications
• /
• v.26 no.8
• /
• pp.1028-1038
• /
• 1999

본 논문에선 LR 문법의 부분 클래스를 동치인 LL 문법으로 변환하는 방법을 제시한다. 이 변환이 적용 가능한 문법을 확장된k`-transformable 문법이라 정의한다. 변환된 문법은 left-to-right 커버의 성질을 만족한다. 기존 연구에서 제시한 변환 방법은 LR 문법의 부분 클래스인 {{{{k`-transformable 클래스와 PLR 클래스를 LL 문법으로 바꾼다. 이 논문에서 제시하는 새로운 변환 방법의 적용 가능한 문법의 범위는 k`-transformable 클래스와 PLR 클래스를 포함한다. 기존의 커버링 성질을 만족하는 LL로의 문법 변환은 보편적인 LR 파서의 행동을 시뮬레이션하여 얻어진다. 이 과정에서 쉬프트, 리듀스 행동 이외에 무한의 가능성을 가진 스택 스트링의 유한 표현을 위해 리덕션 심볼에 대한 예상 행동이 추가된다. 본 논문에서는 파싱 문맥을 나타내는 LR 아이템들을 기존의 스택 스트링 표현 형태에 추가하여 스택 스트링 표현법을 정제하고, 리덕션 심볼에 대한 예상 방법을 확장하는 정형식을 제시한다. 이에 근거하여 LL 커버링 문법이 존재하는 클래스를 확장된 {{{{k`-transformable 문법으로 확장시킨다.Abstract A new transformation of a subclass of LR(k`) grammars into equivalent LL(k`) grammars is studied. The subclass of LR(k`) grammars is called extended k`-transformable. The transformed LL(k`) grammars left-to-right cover the original LR(k`) grammars. Previous transformations transform k`-transformable and PLR(k`) into LL(k`). The new transformation is more powerful in that it handles the extended k`-transformable subclass of LR(k`), which strictly includes k`-transformable and PLR(k`) classes. The previous covering transformations into LL grammars are obtained by simulating the actions of the conventional LR parser. Specially, a predict action of reduction goals is added to the action set in order to finitely represent stack string. In this paper, the stack string representation is refined by adding LR items to represent a parsing context, and the prediction of reduction goal is extended by generalizing the prediction formalism. Based on them, the previous grammar classes with LL({{{{k`) covering grammars are extended to extended k`-transformable grammars.

• Korean Journal of Cognitive Science
• /
• v.6 no.3
• /
• pp.41-63
• /
• 1995

We present a LR,bottom-up parsing algorithms for TAG. We will introduce the adjoining rules system to handle the formal properties of TAG and to describe the parsing process more effectively. We will consider the context-free behavior of TAG at the adjoining instant. Then we will present the LR bottom up parsing algorithm for TAG by using this property. The basic idea behind a LR bottom up parsing algorithm can be applied to parsing TAG with other conventional algorithms.

• Journal of KIISE
• /
• v.43 no.10
• /
• pp.1079-1084
• /
• 2016

Single-state parsing automata have a characteristic such that the decision of an action depends only on the current state but not on the parsing history. The memory space and the parsing time of single-state parsing automata are less than the memory space and the parsing time of LR automata. However, the applicable grammar class of single-state parsing automata is less than that of LR automata. This paper provides extended single-state parsing automata, which are applicable to LR grammars. In the prior work, the special state, referred to as the cyclic state was not treated in the construction of single-state parsing automata, and hence, the applicable grammar class was less than LR grammars. The paper solves the problem of cyclic states by processing dynamic information depending on an input string. The proposed method expands the application of grammar class of single-state parsing automata to LR grammars.

• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.6
• /
• pp.319-322
• /
• 2010

Extended PLR grammars are currently the largest subclass of LR grammars whose grammars are transformed into LL grammars satisfying covering property. This paper suggests a simplified covering transformation of the original covering transformation for extended PLR grammars. The proposed covering transformation reduces the original four rule types to the three rule types.

• Journal of KIISE:Software and Applications
• /
• v.33 no.1
• /
• pp.138-141
• /
• 2006

The subclasses of LR grammars, k-transformable grammars, PLR grammars, and extended PLR grammars are LL covering transformable grammar classes. On other hand, their LL covering transformations are based on different formalisms, and hence, the relationship of the transformations is not obvious. This paper gives a unified model of the LL covering transformations, in which each LL covering transformable grammar class generates its transformation as a specific instance.

• Korean Journal of Cognitive Science
• /
• v.4 no.2
• /
• pp.115-143
• /
• 1994

In this paper,I present an extended two-level model using LR parsing techniques.The LR-based two-level model not only guarantees effcient morphological processing but also achieves a higher degree of descriptive adequacy than Koskenniemi's original model.The two-level model is augmented with an independent morphosyntactic module based on feature-based CF word grammar.By adopting a CF word grammar,our model is capable of dealing with complex words with discontinuous dependencies without having duplicate lexicons.It is shown how LR predictions manifested in the parsing table can help the morphological processor to minimize the dictionary lookup process.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.6
• /
• pp.1660-1669
• /
• 1998

본 논문에서는 실제 사용에 있어서 시간과 기억 장소를 상당히 요구하는 기존의 점진적 파싱 알고리즘들을 조사하여, 이들보다 효율적인 점진적 LR 파싱 알고리즘을 제안한다. 문법 기호를 포함하는 확장형 LR 파싱표를 본 논문에서 제안한 점진적 LR 파싱 알고리즘을 적용한다. 여러 문장의 경우에 본 점진적 LR 파싱 알고리즘을 이용하여 파싱 단계와 기억 장소를 감소시켰다. 본 알고리즘은 복잡하고 큰 문법의 경우에 더욱 효과적이다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.1
• /
• pp.177-183
• /
• 2011

One of the methodologies for the type-checking of an expression is the attribute grammar. But this attribute grammar is difficult to write because two attributes should be used with the full understanding of parsing steps. So this paper proposes a methodology to construct an expression attribute grammar easily. It shows the possibility to check the type of an expression with only one attribute through a grammar construction method.

• Journal of KIISE:Software and Applications
• /
• v.41 no.7
• /
• pp.518-522
• /
• 2014

A single state parsing automaton has the characteristics of the decision of actions which do not depend on the history of the parsing paths but on the current state. The single state parsing automaton hence has the advantage of the reduced parsing time and a small memory requirement compared to those of the conventional LR automaton. However, currently, the grammar classes generating single state parsing automata have not been known. This paper deals with the grammar classes generating single state parsing automata; in addition, this paper gives the generating method of single state parsing automata of the grammar classes.