• Journal of KIISE:Computing Practices and Letters
• /
• v.12 no.6
• /
• pp.379-385
• /
• 2006

To improve reusability and adaptation of variable components, rule-based component development has been used. Rule engines usually need additional script languages for rule expression and have difficulty in expressing complex business rules. In this paper, we propose a compiler-based rule engine for rich rule expression and improving performance. This rule engine uses Java programming language to express conditions and action parts of rules and that it can easily express complex business rules. It creates and executes condition and action objects at run time. In view of Performance, the rule engine is better than a script based rule engine. According to our experiments, our compiler-based nile engine shows 2.5 times better performance that script-based JSR 94 rule engine.

• The KIPS Transactions:PartD
• /
• v.8D no.6
• /
• pp.823-834
• /
• 2001

In the active databases, whenever an event occurs, active rules with the matching event specifications are triggered automatically, its action will be executed. Because these rules may in turn trigger other rules including themselves, the set of rules may be executing each other indefinitely. These problem can be solved by rule termination analysis, and it is efficient for the rule termination to execute in compile time of rule. In this paper we not only design rule compiler with rule termination analyzer, but also propose its execution model and algorithm. The completeness of proposed model is verified by algorithm formalization of rule termination analysis.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.11
• /
• pp.2875-2888
• /
• 1999

In this paper we present compiler-based active rule system to efficiently maintain spatial integrity constraints in a heterogeneous, distributed environment. Specially, the prototype active rule system presented has been developed as a component of a whole middleware system called SDBC(Spatile DataBase Connectivity). Due to this reason, our active rule system is provided for heterogeneous ODBMSs in a distributed environment and used to define spatial integrity constraints using the active rules in E-C-A(Event-Condition-Action) type. Using this active rule system, an application programmer can free himself from a heavier burden on the integrity maintenance of application objects. In the compiler-based approach, active rules applicable to events raised by a database program are directly inserted into the program in a function type by the preprocessor, and then they are compiled with the application program source codes. One advantage of this approach is that there is no run-time overhead accompanied by monitoring all the database transitions when preprocessed program is executed. This active rule system also provides facilities to manage changed rules and dynamically interpret those rules at run-tuime.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.1
• /
• pp.98-103
• /
• 1989

A new system for logic optimization at gate-level is proposed in this paper. Ths system is rule-based, i which the rules represent the local trnsformation replacing a portion of circuits with the simplified equivalent circuits. In this system, 'rule generalization' and 'local optimization' are proposed for effective pattern matching. Rule generalization is used to reduce the circuit-search for pattern matching, and local optimization, to exclude unnecessary circuit-search. In additionk, in order to reduce unnecessary trial of pattern matching, the matching order of circuit patern is included in the rule descriptions. The effectiveness of this system is shown by its application ot the circuits which are generated by a hardware compiler.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.6 no.4
• /
• pp.234-239
• /
• 2006

In the past decade, several tools have been developed to automate the floating-point to fixed-point conversion for DSP systems. In the conversion process, a number of scaling shifts are introduced, and they inevitably alter the original code sequence. Recently, we have observed that a compiler can often be adversely affected by this alteration, and consequently fails to generate efficient machine code for its target processor. In this paper, we present an optimization technique that safely migrates scaling shifts to other places within the code so that the compiler can produce better-quality code. We consider our technique to be safe in that it does not introduce new overflows, yet preserving the original SQNR. The experiments on a commercial fixed-point DSP processor exhibit that our technique is effective enough to achieve tangible improvement on code size and speed for a set of benchmarks.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.2
• /
• pp.151-159
• /
• 2014

We discuss the implementation of a compiler for an imperative programming language, using monad in Haskell. This compiler involves a recursive-descent parser conducting nondeterministic parsing, in which backtracking occurs to try with other rules when the application of a production rule fails to parse an input string. Haskell has some strong facilities for parsing. Its algebraic types represent abstract syntax trees in a smooth way, and program codes by monad parsing are so concise that they are highly readable and code size is reduced significantly, comparing with other languages. We also deal with the runtime environment of the assembler and code generation whose target is the Stack-Assembly language based on a stack machine.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.11a
• /
• pp.1315-1317
• /
• 2013

규칙 기반의 영한 기계번역 시스템의 구문 분석 시스템은 영어의 구문 구조를 기술하는 규칙 부분과 규칙을 적용하여 차트 파싱을 수행하는 실행 부분으로 구성된다. 구문 규칙은 문맥 자유 문법의 형식으로 기술되는데, 기술된 구문 규칙을 적용하여 파싱을 실행하는 실행 부분은 C 언어 함수로 표현되므로, 구문 규칙을 C 언어 함수로 변환해야 한다. 본 논문에서는 문맥 자유 문법 형식으로 기술된 구문 규칙을 C 언어 함수로 변환하는 도구인 구문 규칙 컴파일러를 개발하였다. 구문 규칙 컴파일러는 자동적으로 구문 규칙을 C 언어 함수로 변환함으로써 영한 기계번역 시스템의 성능 개선 과정에서 빈번하게 발생하는 구문 규칙의 생성과 수정을 용이하게 하여 번역 성능을 개선하는 작업을 지원한다.

• Journal of Information Processing Systems
• /
• v.1 no.1 s.1
• /
• pp.41-48
• /
• 2005

This paper presents the development of a morphological processor for the Mongolian language, based on the two-level morphological model which was introduced by Koskenniemi. The aim of the study is to provide Mongolian syntactic parsers with more effective information on word structure of Mongolian words. First hand written rules that are the core of this model are compiled into finite-state transducers by a rule tool. Output of the compiler was edited to clarity by hand whenever necessary. The rules file and lexicon presented in the paper describe the morphology of Mongolian nouns, adjectives and verbs. Although the rules illustrated are not sufficient for accounting all the processes of Mongolian lexical phonology, other necessary rules can be easily added when new words are supplemented to the lexicon file. The theoretical consideration of the paper is concluded in representation of the morphological phenomena of Mongolian by the general, language-independent framework of the two-level morphological model.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.05a
• /
• pp.530-531
• /
• 2008

많은 DSP 등에서 Multi-Output Instructions(MOI)를 지원하나 이를 사용할 수 있는 컴파일러가 없다. 그래서 기존연구에서 이 문제를 해결하는 새로운 코드 생성 알고리즘을 개발하여 소개하였다. 하지만, 이 논문에서 제시한 방법은 많은 제약이 있어, 본 논문에서는 기존 논문에서 사용한 MOI를 위한 compiler grammar rule description을 확장하고, 알고리즘을 변경하여 기존에 제안된 방법이 해결할 수 없었던 MOI 들까지 모두 컴파일러에서 처리할 수 있도록 하였다.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.4
• /
• pp.60-68
• /
• 1998

In this paper, content addressable momory(CAM) using neural network algorithm is proposed to decrease cell loss and process the large amount of data in streaming mode connectionless server at high speed. To overcome problems of area and power dissipation in look-up table using conventional CAM, the proposed neural network CAM is designed to increase linearly address storage bit about increase of address input bit. Its design and imulation is performed by using VHDL and Compass Tool. Also, its layout is performed by using chip compiler, cell-base P&R tool of compass, in 0.8 .mu.m design rule environment.