한국정보과학회논문지:소프트웨어및응용 (Journal of KIISE:Software and Applications)

한국정보과학회 (Korean Institute of Information Scientists and Engineers)
권호 표지

LL 언어의 특징화

Characterization of LL languages

  • Lee, Gyung-Ok (Dept. of Information Communication Engineering, Hanshin University)
  • 발행 : 2002.02.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

주어진 문법이 LL 언어를 생성하는가의 문제를 LL 변환 가능성의 관점에서 조사한다. LL 변환 가능 문법을 특징짓기 위해 기존의 방법은 비결정적인(nondeterministic) 복잡한 파서의 생성을 필요로 한다. 이에 기존 방법으로는 LL 언어의 본질에 대한 직관적인 이해가 어렵다. 이 단점을 극복하고자 본 논문에선 파서의 생성 없이 문법 자체의 분석을 통한 문법 유도(derivation)에 근거한 특징화를 제시한다. 새로운 특징화는 LL 언어의 본질에 대한 직관적인 이해를 도울 수 있다.

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.

키워드

참고문헌

  1. Rosenkrantz, D. J. and Stearns, R. E., 'Properties of Deterministic Top-Down Grammars,' Information and Control, Vol. 17, pp. 226-256, 1970 https://doi.org/10.1016/S0019-9958(70)90446-8
  2. Foster, J.M., 'A Syntax Improving Program,' Comput. J., Vol. 11, pp. 31-34, 1968 https://doi.org/10.1093/comjnl/11.1.31
  3. Wood, D., 'The theory of left factored languages:Part I', The Computer Journal, Vol. 12, pp. 349-356, 1968 https://doi.org/10.1093/comjnl/12.4.349
  4. Wood, D., 'The theory of left factored languages:Part II,' The Computer Journal, Vol. 13, pp. 55-62, 1970 https://doi.org/10.1093/comjnl/13.1.55
  5. Soisalon-Soininen, E., Ukkonen, E., 'A Method for Transforming Grammars into LL(k) form,' Acta Informatica Vol. 12, pp.338-369, 1979 https://doi.org/10.1007/BF00268320
  6. Hammer, M., A New Grammatical Transformation into deterministic top down form, p. 301, MIT, Mass, Project MAC Technical Report TR-119, 1974
  7. Hammer, M. 'A New Grammatical Transformation into LL(K) form,' Proc. of Sixth Annual ACM Symposium on Theory of Computing, pp. 266-275 https://doi.org/10.1145/800119.803904
  8. 이경옥, 최광무, 'LL(k) 커버링 문법의 확장', 정보과학회 논문지(B) 26권 8호, pp. 1028-1038, 1999
  9. Aho, A. V. and Ullman, J. D., The Theory of Parsing, Translation and Compiling, vols.1 2. p.1002, Englewood Cliffs, NJ:Prentice-Hall 1972, 1973
  10. Sippu, S. and Soisalon-Soininen, E., Parsing Theory, vol I, II, p. 228, p.426, Springer-Verlag Berlin Heidelberg, 1990
  11. Lee, Gyung-Ok, 'A grammatical derivation approach over ktransformable grammars,' Journal of Hanshin Information and Science Research Institute, 2000
  12. Lee, Gyung-Ok On LL-to-LR Covering Languages, p. 74, Ph.D.Thesis, KAIST, 1999