• Journal of KIISE:Software and Applications
• /
• v.29 no.1_2
• /
• pp.126-131
• /
• 2002

The problem whether a given grammar G generates an LL language or not is investigated in respect of LL transformable grammars. The previous work involves a nondeterministic intricated parser construction for the characterization of LL transformable grammars. The method hence does not give the intuitive understanding of the essence of LL languages. This paper suggests a characterization of LL transformable grammars based on grammatical derivations instead of the complicated parser construction. The new characterization contributes to intuitive understanding of the essence of LL languages.

• 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.

• 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.

• 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 the Korean Institute of Oriental Medical Informatics
• /
• v.14 no.1
• /
• pp.1-18
• /
• 2008

The elementary idea of 'function-words' in Classical Chinese originates from Han dynasty. But because of the pictographic nature the methodology for 'content words' had been applied to the study on 'function words', ane the conditions had not changed until modern times. In grammar functions of the function-word syntactical, morphological in unit sentence were studied in this using the method of quantitative analysis for all the function-words appeared in ${\ll}$Hwang je nae gyung-Somun${\gg}$. In the previous studies about function word, many data were collected and analyzed diachronically. But those studies failed to examine function-words closed in connection with synchronic study. Besides, in the explain about relevant function-words also, the case which was made centering around exegetic explain was most. And in the case to explain the function-words have in unit sentence also, the explain only about some function-words is made, but the analysis about concrete function to have in syntactical system is being handled negligently. This study stands not only on the background df the traditional studies but also on the basis of the western grammar and linguistics, especially the descriptive grammar and linguistics, especially the descriptive grammar. ${\ll}$Hwang je nae gyung-Somun${\gg}$ is collect and recorded the mythology and special contents related to Daoism in the side of contents as what was written on the basis of the historical consciousness of individual in contents regardless of compilation system. The purpose of this study is to clarify how the role and function of fuction-words are being made in the composition of unit sentence which appeard in ${\ll}$Hwang je nae gyung-Somun${\gg}$ through synchronic grammar system.

• Journal of KIISE
• /
• v.44 no.3
• /
• pp.239-245
• /
• 2017

Probabilistic grammar is used in natural language processing, and the parse result of the grammar has to preserve the probability of the original grammar. As for the representative parsing method, LL parsing and LR parsing, the former preserves the probability information of the original grammar, but the latter does not. A characteristic of a probabilistic parsing automaton has been studied; but, currently, the generating model of probabilistic parsing automata has not been known. The paper provides a model of probabilistic parsing automata based on the single state parsing automata. The generated automaton preserves the probability of the original grammar, so it is not necessary to test whether or not the automaton is probabilistic parsing automaton; defining a probability function for the automaton is not required. Additionally, an efficient automaton can be constructed by choosing an appropriate parameter.

• 중국학논총
• /
• no.69
• /
• pp.25-51
• /
• 2021

漢語量詞有着悠久的歷史傳統, 種類和數量也豊富多彩。在先秦典籍中的稱數方式, 數詞直接修飾名詞爲最普遍的語法現象。最初量詞起於度量衡和貨幣單位, 以逐漸擴大到普通名詞, 雖名詞代替量詞角色, 而詞性仍是无法改變而保持着實詞功能, 因此在量名的語法功能上混淆不清。量詞随着社会變化和發展而大量出現, 也逐漸脱离名詞角色而獨立活動, 詞性也虚化而變成完整的量詞。《論》 《孟》時期乃爲量詞的初期階段, 雖然能見到名量詞的出現, 而動量詞尚未達到成熟階段。《論語》中的量詞出現不甚多, 結构類型也可以看到初期量詞的形狀。《孟子》中的量詞多于《論語》中的出現頻度, 但不能算是大幅度地增加, 二書所有的用例313个當中, 出現在《孟子》的235个例子占有總數的75.1%。幷且類似于現代漢語的量詞類型就是"數量名"結构形式, 《孟子》中一共有64个例子出現, 占有總數的80%。這是表明在先秦時期中的量詞認眞地遵從語言發展的規律。

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

Incremental parsing has been researched in the intention that the parse result of the original string is reused in the parsing of a new string. This paper proposes an improved method of the previous incremental LL(1) parser with nonterminal lookahead symbols. The previous work is time-inefficient because it repeatedly performs unnecessary steps when an error occurs. This paper gives a solution for the problem.

• Journal of KIISE:Software and Applications
• /
• v.37 no.11
• /
• pp.845-850
• /
• 2010

Incremental parsing has been developed to reuse the parse result of the original string during the parsing of a new string. The previous incremental LL(1) parsing methods precomputed the reusable point information before parsing and used it during parsing. This paper proposes an efficient reusable point computation by factoring the common part of the computation. The common symbol storing method and the distance storing method were previously suggested to find the reusable point, and by combining the methods, this paper gives the storing method of the distance to common symbols. Based on it, an efficient incremental LL(1) parser is constructed.