Journal of KIISE:Computer Systems and Theory (한국정보과학회논문지:시스템및이론)

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

Simplification of Covering Transformation into LL Grammars

LL 문법으로의 커버링 변환의 단순화

  • Received : 2010.06.03
  • Accepted : 2010.10.20
  • Published : 2010.12.15
Download PDF
⟨ Previous Next ⟩

Abstract

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.

확장된 PLR 문법은 LR 문법의 부분 클래스로서 LL 문법에 대한 커버링 성질을 만족하는 변환이 존재하는 현재까지의 가장 큰 문법 클래스이다. 본 논문에서는 확장된 PLR 문법에 대한 기존 커버링 문법 변환을 단순화시키는 커버링 문법 변환을 제시한다. 본 논문에서 제시하는 커버링 문법 변환은 기존의 4개의 규칙 유형을 3개의 규칙 유형으로 축소시킨다.

Keywords

References

  1. D. E. Knuth, "On the translation of languages from left to right," Information and Control, vol.8, pp.607-623, 1965. https://doi.org/10.1016/S0019-9958(65)90426-2
  2. D. E, Knuth, "Top down Syntax," Acta Informatica, vol.1, pp.79-110, 1971. https://doi.org/10.1007/BF00289517
  3. M. Hammer, "A new grammatical transformation into LL(k) form," Proc. of Sixth Annual ACM Symposium on Theory of Computing: ACM, pp. 266-275, 1974.
  4. E. Soisalon-Soininen and E. Ukkonen, "A method for transforming grammars into LL(k) form," Acta Informatica, vo1.12, pp.338-369, 1979.
  5. G.-O. Lee and K-M. Choe, "A powerful LL(k) covering transformation," SIAM J. Computing, vol.35, no.2, pp.359-377, 2006.
  6. A.V. Aho and J.D. Ullman, The Theory of Parsing, Translation and Compiling, vols. 1 & 2, Prentice-Hall, Englewood Cliffs, NJ, 1972, 1973.
  7. S. Sippu and E. Soisalon-Soininen. Parsing Theory, vols. I & II, Springer, Berlin, 1990.