A Program Transformational Approach for Rule-Based Hangul Automatic Programming 


Vol. 1,  No. 1, pp. 114-128, May  1994
10.3745/KIPSTE.1994.1.1.114


PDF
  Abstract

It is very difficult for a nonprofessional programmer in Korea to write a program with very High Level Language such as, V, REFINE, GIST, and SETL, because the semantic primitives of these languages are based on predicate calculus, set, mapping, or testricted natural language. And it takes time to be familiar with these language. In this paper, we suggest a method to reduce such difficulties by programming with the declarative, procedural constructs, and aggregate constructs. And we design and implement an experimental knowledge-based automatic programming system, called HAPS(Hangul Automatic Program System). HAPS, whose input is specification such as Hangul abstract algorithm and datatype or Hangul procedural constructs, and whose output is C program. The method of operation is based on rule-based and program transformation technique, and the problem transformation technique. The problem area is general problem. The control structure of HAPS accepts the program specification, transforms this specification according to the proper rule in the rule-base, and stores the transformed program specification on the global data base. HAPS repeats these procedures until the target C program in fully constructed.

  Statistics


  Cite this article

[IEEE Style]

H. S. Soo, L. S. Rak, S. J. Hong, "A Program Transformational Approach for Rule-Based Hangul Automatic Programming," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 1, no. 1, pp. 114-128, 1994. DOI: 10.3745/KIPSTE.1994.1.1.114.

[ACM Style]

Hong Sung Soo, Lee Sang Rak, and Sim Jae Hong. 1994. A Program Transformational Approach for Rule-Based Hangul Automatic Programming. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 1, 1, (1994), 114-128. DOI: 10.3745/KIPSTE.1994.1.1.114.