• Journal of KIISE:Software and Applications
• /
• v.37 no.6
• /
• pp.446-454
• /
• 2010

According to the original chart parsing algorithm, a sentence is parsed in a strict left-to-right order. The modified chart parsing algorithm proposed in this paper breaks the strictness. With the proposed algorithm, a sentence is parsed in a random order. Conventional left-to-right parsing is also possible, since left-to-right parsing is a special case of random-order parsing. The proposed parsing algorithm is an extension of chart parsing algorithm and its control structure is very simple, so that it is easy to implement the algorithm.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.4
• /
• pp.9-17
• /
• 1994

The incremental parsing techniques are essential part of language-based environment which allow incremental construction of programs, as reparsing of modified part of the program alone enhances the system performance. A number of methods and algorithms have been proposed for incremental parsing and for the construction of incremental parsers. The purpose of this paper is to review the earlier incremental parsing algorithms which are too expensive in both time and space, and to present an efficient incremental LR parsing algorithm which is more efficient than the previous ones. In this paper, we generate automatically an extended LR parsing tables which allow the nonterminal symbols as well as terminal symbols for the input, and apply them to our efficient incremental LR parsing algorithm. Using these extended LR parsing tables. we suggest several methods to reduce its memory spaces and parsing steps as well. The algorithms described here were implemented in C language and YACC on a SUN UNIX OS, and were tested with several grammars and strings.

• Journal of Internet Computing and Services
• /
• v.7 no.4
• /
• pp.91-99
• /
• 2006

The incremental parsing technique plays an important role in language-based environment which allows the incremental construction of a program. It improves the performance of a system by reanalyzing only the changed part of a program. The conventional incremental parsing uses the stack data structure in order to store the parsing information. In this paper, we suggest a threaded tree construction algorithm which parse by adding the threaded node address instead of using a stack data structure. We also suggest an incremental threaded tree construction which has incremental parsing process of five steps using the constructed threaded tree.

• Journal of KIISE
• /
• v.42 no.3
• /
• pp.361-366
• /
• 2015

Gap parsing is an algorithm for parsing incomplete input strings which include some gaps. Gap parsing is different from conventional parsing, and as known results, one-gap parsing algorithms for arbitrary context-free grammar and LL(1) grammar have $O(n^3)$ and $O(n^2)$ time complexity, respectively. This paper presents a one-gap parsing algorithm for extended PLR(1) grammars. Extended PLR(1) grammars are the class of grammars smaller than LR(1) but much larger than LL(1). The one-gap parsing algorithm of the grammar class is shown to have the time complexity of $O(n^2)$, which is equal to the complexity of one-gap parsing algorithms for LL(1) 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.

• Convergence Security Journal
• /
• v.5 no.4
• /
• pp.19-25
• /
• 2005

Threaded Tree is the data structure that can express parse stack as well as parse tree with LR parsing table. $Larchev\^{e}que$ makes Threaded Tree and Incremental Parsing with stack. This paper suggests the algorithm consisting of changed threaded tree without stack in order to reduce reparsing node and parsing speed. Also, it suggests incremental parsing algorithm to get rid of the reparsing process in node.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.55 no.6
• /
• pp.274-278
• /
• 2006

An upgraded algorithm that in proves the performance of existing interfacing software for parsing HL7 messages is introduced. It incorporates stack operations on objects to guarantee segment order while parsing messages. This object-oriented design greatly facilitates the complicated process of validating, parsing, and creating HL7 messages in the clinical setting. The new interface engine can manage all HL7 messages corresponding to admission and registration, discharge and transfer, laboratory results, clinical images, and clinical reports. The international version of this engine, currently under development, will be tested in Asian countries using standard character code such as Unicode (ISO 10646).

• Journal of Internet Computing and Services
• /
• v.5 no.5
• /
• pp.119-127
• /
• 2004

As, the development of language-based programming environment, a study on incremental parsing has become an essential part. The purpose of this paper is to show the more efficient incremental parsing algorithm than earlier one that demands parsing speed and memorizing space too much. This paper suggests the threaded tree construction algorithm not using stack. In addition, to remove the reparsing process, it proposes the algorithm for creation node and construction incremental threaded tree not using stack.

• Journal of KIISE:Software and Applications
• /
• v.36 no.7
• /
• pp.571-579
• /
• 2009

A left-comer and look-ahead chart parsing algorithm suppresses the generation of meaningless intermediate structures, and thus, gains parsing speed-ups. However, the algorithm requires additional costs to maintain left-comer and look-ahead information throughout the parsing process. Albeit the additional costs, previous research shows that significant parsing speed-ups have been achieved for large-sized context-free grammars. In this paper, we perform similar experiments with a small-sized grammar. We still get parsing speed-ups, but relatively low. We also find that left-comer information has rather negative effects on parsing speed-ups.

• ETRI Journal
• /
• v.32 no.3
• /
• pp.486-489
• /
• 2010

This letter presents a modified Pegasos algorithm for graph-based dependency parsing. We show that the modified Pegasos algorithm outperforms the margin infused relaxed and passive aggressive algorithms in three languages.