생략 가능한 특수 터미날 심볼의 오류보정

Abstract

본 논문에서는 프로그램 작성시 주어진 투수 터미널 심볼의 생략 가능성을 분류하기 위한 형식론을 제안한다. 제안된 방법을 만족하는 문법의 경우, 생략된 심볼의 어휘 분석단계(lexical analysis phase)나 구문분석단계(syntax analysis phase)와 같은 컴파일하는 각 단계에서 보정할 수 있게 한다. 그리고, 제시된 방법에 근거하여, 각 컴파일 단계에서 복구할 수 있는 심볼이 포함된 프로그래밍 언어들의 특성을 논의한다. 또한, 제안된 방법론을 실제 구현하였으며 Ada나 Modula-2와 같은 주요 프로그래밍 언어들에 적용하였다. 이들 언어들에 대해서는 심볼을 생략함으로써 야기되는 오류를 만족할만하게 보정해 준다. 제안된 방법을 적용하기 어려운 프로그래밍 언어들에 대한 특성 또한 논의되었다.

This paper presents a formalism for classifying the possibility of omitting a given special terminal symbol when writing programs. For the grammars satisfying the proposed formalism, the formalism enables to repair the symbol during phases of compilation such as lexical analysis or syntax analysis. Based on the method, this paper also discusses the characteristics of programming languages in which the symbol is repaired during such phases. The method was implemented and applied to major programming languages such as Ada and Modula-2, repairing satisfactorily the errors caused by omitting the symbol. In addition, the characteristics of the programming languages to which the presented method is hardly applicable, are discussed.

This paper presents a formalism for classifying the possibility of omitting a given special terminal symbol when writing programs. For the grammars satisfying the proposed formalism, the formalism enables to repair the symbol during phases of compilation such as lexical analysis or syntax analysis. Based on the method, this paper also discusses the characteristics of programming languages in which the symbol is repaired during such phases. The method was implemented and applied to major programming languages such as Ada and Modula-2, repairing satisfactorily the errors caused by omitting the symbol. In addition, the characteristics of the programming languages to which the presented method is hardly applicable, are discussed.