• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.1
• /
• pp.171-176
• /
• 2011

An attribute grammar is a set of semantic rules added to the syntax rules. This attribute grammar uses two attributes. It is difficult to write by its additional rules to the existing syntax rules with two attributes understanding the parsing steps. So this paper analyses attributes and an attribute grammar to construct the attribute grammar easily proposing three definitions and shows a possibility that an attribute grammar can be written with only one attribute in some cases.

• The Journal of Information Technology
• /
• v.6 no.4
• /
• pp.113-123
• /
• 2003

This paper is the study for code generation using attribute grammar without cycle. For the purpose of this study, we designed metalanguage SDL which describes an attribute grammar and, represented attribute grammar to SDL. This attribute grammar is based on L-attributed grammar without cycle. This system consists of attributed-grammar analyzer and attribute evaluator. Attributed grammar analyzer takes a semantic description language and then generates useful informations that are needed by attribute evaluator. The evaluator calculates an attribute values using these information.

• 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.

• Journal of Korea Multimedia Society
• /
• v.14 no.2
• /
• pp.282-287
• /
• 2011

The attribute grammar is a grammar for static semantic rules to overcome the difficulties of type checking. But this attribute grammar is difficult to write and understand by its additional rules. A grammar would be preferable if it has simple and small size of an attribute grammar. This paper shows how to decrease the size of an attribute grammar for an expression using LH method. This approach considers the types of an expression. That is, the construction of a semantic relation between the types of the expression can make it possible that an attribute grammar be written with its simpler and smaller size.

• The KIPS Transactions:PartA
• /
• v.8A no.3
• /
• pp.209-216
• /
• 2001

The effective way to apply incremental attribute grammar to a complex language process is the use of optimized algorithm. In optimized algorithm for incremental attribute grammar, the new input attribute tree should be exactly compared with the previous input attribute tree, in order to determine which subtrees from the old should be used in constructing the new one. In this paper the new optimized algorithm was reconstructed by analyzing the algorithm suggested by Carle and Pollock, and a generation process of new attribute tree d’copy was added. Through the performance evaluation for the suggested matching algorithm, the run time is approximately improved by 19.5%, compared to the result of existing algorithm.

• Journal of KIISE:Software and Applications
• /
• v.31 no.2
• /
• pp.224-234
• /
• 2004

An XML document processor should process the XML documents according to their purposes and semantics. It is very hard to automatically generate an XML document processor with DTD, because it does not provide the semantic information. In this paper, we introduce an XML document processor generator and a method for specifying semantics using the object-oriented attribute grammar. The XML document processor generator will reduce costs and efforts in developing XML document processors.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.10b
• /
• pp.957-960
• /
• 2000

프로그래밍 환경이 단순구조 편집환경에서 보다 복잡한 환경으로 진보되고, 언어 기반 편집 환경의 비중이 확대되면서 속성 문법의 점진적 평가의 이용이 효과적이다. 점진적 평가는 새로운 속성 트리가 기존의 속성 트리와 정확히 비교되어 기존 속성 트리를 사용하여 새로운 속성 트리를 구성한다. 본 논문에서는 Carle의 알고리즘을 분석하고 새로운 점진적 평가 알고리즘으로 재구성한다. 특히, 새로운 속성 트리 $d'_{copy}$의 생성 과정과, 최적화된 속성트리의 새로운 점진적 평가 알고리즘을 추가한다.

• Journal of Internet Computing and Services
• /
• v.2 no.3
• /
• pp.71-79
• /
• 2001

In Incremental attribute evaluation algorithm, a new input attribute is exact1y compared with a previous input attribute tree, and then determine which subtrees from the old should be used in constructing the new one. In this paper incremental attribute evaluation algorithm was used to make incremental evlauation of hierarchical attribute grammar more efficient1y, and reconstructing the incremental attribute evaluation algorithm by analyzing that of Carle and Pollock, finally the incremental attribute evaluation algorithm for optimalized attribute tree d' copy was constructed by applying element of attribute !ree dcopy to a new attribute tree d' copy. Also proving that how the reused nod and type of defined parameter in input program carried out the incremental attribute evaluation by using that algorithm.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.3
• /
• pp.85-94
• /
• 1989

This paper proposes a method to recognize vowels and consonants in a handwritten Hangul text, in which the sizes of chracters and the spaces between characters are not uniform. In this method, all characters in the thinned image of a handwritten Hangul text are transformed into strokes, and the attributes which represent the relations between strokes are extracted from these strokes, and the attributes which represent the relations between strokes are extracted from these strokes. The vowels and consonants are recognized by applying attributed grammars to the strokes and attributes.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04a
• /
• pp.46-48
• /
• 2001

속성에 할당된 새로운 조건을 통해 평가를 수행할 때 이미 산출된 부분을 재사용하기 위해서는 새로운 평가방법이 필요하다. 이 논문에서는 평가된 속성 값의 전파를 고려한 최적화 알고리즘을 제안하는 기존 속성 트리의 서브 트리와 새로운 속성 트리의 서브 트리를 비교하여 전파되는 속성 값과 노드가 일치할 경우 기존 속성 트리의 서브 트리를 새로운 속성 트리에서 사용이 가능한 최적화된 알고리즘을 제안하고 평가하였다.