• Title/Summary/Keyword: LL(1) 문법

Search Result 9, Processing Time 0.021 seconds

A One-Gap Parsing with Extended PLR(1) Grammars (확장된 PLR(1) 문법에 대한 단일 틈 파싱)

  • Lee, Gyung-Ok
    • 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.

A unified model of the LL covering transformations (LL 커버링 변환에 관한 통합 모델)

  • Lee Gyung-Ok
    • 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.

Testing of Extended PLR Grammars (확장된 PLR 문법의 테스팅)

  • Lee, Gyung-Ok
    • 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.

Characterization of LL languages (LL 언어의 특징화)

  • Lee, Gyung-Ok
    • 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.

A Research on the Efficient Type-Checking for an Expression Using LL and LR (LL과 LR에서의 효율적인 수식 타입 체킹에 대한 연구)

  • Chung, Yong-Ju
    • 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.

An Improved Incremental LL(1) Parsing Method (개선된 점진적 LL(1) 파싱 방법)

  • Lee, Gyung-Ok
    • 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.

Computation of Reusable Points in Incremental LL(1) Parsing (점진적 LL(1) 구문분석에서의 재사용 시점의 계산)

  • Lee, Gyung-Ok
    • 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.

略论$\ll$伤寒论$\gg$ 中 "而"字的用法 ($\ll$상한론$\gg$중 "이(而)"자(字)의 용법에 대한 약론(略論))

  • ;Kim, Hyo-Cheol
    • Journal of Korean Medical classics
    • /
    • v.24 no.1
    • /
    • pp.111-113
    • /
    • 2011
  • 본 논문에서는 중의학에 나오는 중국어 문법을 토대로 문헌자료를 분석하는 방법을 사용하여, "상한론"에 나오는 '이(而)'자(字)의 용법을 분류하고 조문별로 해석해 보았다. 우선 기존에 분류된 '이(而)'자(字)의 용법을 기준으로 하여, "상한론"의 조문 중에서 '이(而)'자(字)를 포함하고 있는 것을 모두 취합한 뒤 이를 분류하였고 주요 조문을 첨부하여 참고하도록 하였다. 향후 이러한 언어학적인 연구들은 장중경 "상한론"의 의미를 보다 정확하게 파악하는데 도움이 될 것으로 기대된다.

Semantische Unbestimmtheit der Skalaradjektiven (척도형용사의 의미적 불확정성에 대한 연구)

  • Chung Dong-Gyu
    • Koreanishche Zeitschrift fur Deutsche Sprachwissenschaft
    • /
    • v.10
    • /
    • pp.277-296
    • /
    • 2004
  • Ein sprachlicher Ausdruck ist in verschiedenen Situationen in einer Vielzahl unterschiedlicher Lesarten oder $Pr\"{a}zisierungen$ verwendbar, und zwar mil dom Grad an $Pr\"{a}zision$, der den jeweiligen kormmunikativen Erfordernissen angemessen ist. Sokommt Vagheit/$Ambiguit\"{a}t$ in sprachlichen Ausdrucken fast $durchg\"{a}ngig$ vol. In der vorliegenden Albeit wird die $M\"{o}glichkeit$ der semantischen $\"{U}bersetzung$ der Skalaradjektiven($gro{\ss}$, klein, $hei{\ss}$, kalt, schwer, leicht, schnell, langsam usw.) untersucht, die eigentlich die Vagheit als eine der konstitutiven Eigenschaften haben. Den Schwerpunkt $daf\"{u}r$ bildet die semantische Analyse $\"{u}ber$ die Graduierbarkeit und Vergleichbarkeit der Positivformen der Adjektiven, die vol allem M.J.Cresswell 1976 in seiner Albeit formuliert hat. V(pos) is the function $\eta$ in $D_{{\lll}{0,1}>,<{0,1}{\gg}.{\ll}{0,1,1},>,<{0.1}{\ggg}$ such that where ${\xi}{\in}D_{{\ll}{0,1,1},><{0,1}{\gg}$,$\eta({\xi})$ is the following function: For any ${\omega}{\in}D_{<0,1>$and a ${\in}D_1$ and w$\in$W, w${\in}{\eta}({\xi})({\omega})$(a) iff w ${\in}{\omega}$(a) and there is exactly one b such that ${\xi}({\omega})$(a,b); and for that b, b=$\gg$(for some > and u ${\in}{ \scr}{Z}(>))$ and u is toward the top of the scale determined by > when restricted to those v such that for some c, w${\in} {\xi}({\omega})$$(c,{\;} and w${\in}{\omega}(c)$. (Cresswell, 1976: 272) Obwohl sein Verfahren anhnd von dem semantischen Symbol eine methodische und theoretische $Ad\"{a}quatheit$ erf\"{u}llt$, bleibt der Vergleichwert noch unterspezifiziert. Fur die Behandlung dieser semantischen Unterspezifikation ist eine neue Semantik erforderlich, die den Wahrheitwert fur die $Zugeh\"{o}rigkeitsgrade$ der Skalaradjektive $einschlie{\ss}t$.

  • PDF