http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
안희학 관동대학교 1993 關大論文集 Vol.21 No.2
Using a similar data structure, R. agrawal first presents an incremental LR parsing algorithm which allows not only multiple modifications in the original input, but also epsilon productions in the underlying LR grammar. This paper is concerned with the realization of effective incremental parsers: an algorithm for incremental parsing of LR language is presented. We suggest several improvements to reduce its storage requirement and to speed it up as well. In this paper, we present the details of an implementation of A. Celentano's suggestion for a linear time reformulation to his incremental parsing algorithm. The algorithm described here has been implemented in C on a UNIX 4.2BSD and was tested on a subset of PASCAL grammar. A major application of incremental parsers has been in building syntax-directed editors.
安熙學 관동대학교 1991 關大論文集 Vol.19 No.2
In late 1970s, several new programming paradigms: logical, parallel, and object-oriented programming, which are different from conventional programming languages such as Pascal and Ada, have been appeared to support those fast and parallel computers. In this paper, we study a functional language and concert with the design of the new programming languages based on functional languages such as FP, HOPE, ML, Miranda, Haskell. In order to design the functional languages, this paper considers underlying theories, characteristic, syntax, and semantics of the new programming language. In specialty, we present BNF of Miranda/ subset, and design Miranda/subset language.
안희학,유채우,송후봉 대한전자공학회 1994 전자공학회논문지-B Vol.b31 No.4
The incremental parsing techniques are essential part of language-based environment which allow incremental construction of programs, as reparsing of modified part of the program alone enhances the system performance. A number of methods and algorithms have been proposed for incremental parsing and for the construction of incremental parsers. The purpose of this paper is to review the earlier incremental parsing algorithms which are too expensive in both time and space, and to present an efficient incremental LR parsing algorithm which is more efficient than the previous ones. In this paper, we generate automatically an extended LR parsing tables which allow the nonterminal symbols as well as terminal symbols for the input, and apply them to our efficient incremental LR parsing algorithm. Using these extended LR parsing tables. we suggest several methods to reduce its memory spaces and parsing steps as well. The algorithms described here were implemented in C language and YACC on a SUN UNIX OS, and were tested with several grammars and strings.
正規表現에 의한 確定 有限 오토마타의 確率的 分析에 關한 硏究
安熙學 관농대학교 1986 關大論文集 Vol.14 No.2
Regular expressions define a class of languages which is central in formal language theory and automata theory. The class is known as the class of regular sets(regular languages). The flow-graph technique for transforming a deterministic finite automata into a regular expression was suggested first by Arden and discussed in detailed by Brzozowski and AcCluskey. Solving to equations of regular expressions by Arden`s rule, we find that they muts always describe the same sets. This paper presents a methods for calculating steady state probabilities from state diagram and transition matrix of given regular expressions E=I*ST*.
다중 SNS 채널 자동 스트리밍 서버의 RELAY 모듈 설계
안희학,이대식 (사)디지털산업정보학회 2017 디지털산업정보학회논문지 Vol.13 No.4
Streaming server is that an image produced in real time or a file form of image produced ahead consists of SNS service, and the relay module of streaming server includes output management module that set an output channel more than 2 and control transmission of video content. This thesis intends to suggest how to stream through plural output channel that contains output channel of external streaming server using relay module and do streaming provided to terminal receiving image, and streaming server, streaming system for this. Thus, by extending output channel sending out image to output channel of external streaming server, the scale of streaming server is not limited and the process allotting external streaming server into output channel sending the image becomes simple, so management of output channel becomes efficient even when sending several images.
資料 흐름 分析을 위한 알고리즘의 性能 評價에 관한 硏究
安熙學 관동대학교 1990 關大論文集 Vol.18 No.1
A global data flow algorithm gathers information about the definition and use of data in a procedure or a set of programs. Data flow analysis algorithms gather this local information and infer global data flow from it. Data flow analysis information can be used as a debugging and documentation aid. There are two families of global data flow algorithms in use : the elimination methods and iterative methods. The elimination methods include an original algorithm, Allen-Cocke interval analysis, and Hecht-Ullman analysis. The original algorithm, Allen-Cocke interval analysis, establisher a natural partition of the variables and a variable order on each of a sequence of systems that, when used to order the equtions, results in a highly structured coefficient matrix fcilitating the equation-reduction process. The order algorithm, Hecht-Ullman analysis, avoid repeated calculations of common substitution sequences in the equations by delaying certain computtions. The two algorithms vary in their worst case complexity bounds for reducible flow graphs as shown : complexity Allen-Cocke algorithm is O(N) and complexity of Hecht-Ullman algorithm is O(n log n). This paper provides a study in algorithm design, as well as a new view of these algorithms and their interrelationships.
安熙學 관동대학교 1988 關大論文集 Vol.16 No.2
The problem of the inference of context free grammars is studied from both an abstract and practical point of view. The theoretical aspects of grammatical inference are considered. The structural and statistical properties of context free grammars are analyzed. The statistical closeness of approximation of the sample set by the language of the inferred grammar is measured by a chi-square test. This paper presents the graph of word function found from a given sample set. The inference algorithm of context free grammars is implemented using PASCAL.