DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Choe, Kwang-Moo | - |
dc.contributor.advisor | 최광무 | - |
dc.contributor.author | O, Seung-Hwan | - |
dc.contributor.author | 오승환 | - |
dc.date.accessioned | 2011-12-13T05:26:09Z | - |
dc.date.available | 2011-12-13T05:26:09Z | - |
dc.date.issued | 2006 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=258165&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/33215 | - |
dc.description | 학위논문(박사) - 한국과학기술원 : 전산학전공, 2006.8, [ vi, 74 p. ] | - |
dc.description.abstract | Abstract interpretation was introduced as a framework for construction of static analysis of computer programs. Abstract interpretation can be regarded as a partial execution of programs with information about its semantics and without performing all the computation. Originally abstract interpretation was applied to static analysis of programs. However it turned out that abstract interpretation also can be used in representing the relationships between various formal semantics which are expressed by fixpoint semantics. On the other hand, it is well known that a context free grammar can be regarded as a kind of deductive system. Moreover it is also known that a deductive system can expresses a fixpoint semantics. Based on these two ideas, it is possible to represent a semantics of a given context free grammar by a fixpoint semantics and express a parser of the grammar with an abstract interpretation of the semantics of the grammar. Cousot and Cousot represented Earley``s parsing algorithm as an abstract interpretation in their research, and they expected that it would be possible to express other parsing algorithms with similar method. On the other hand, LR(k) parsing is the strongest deterministic parsing algorithm, and LL(k) parsing is a top-down dual of LR(k) parsing. These are among the strongest deterministic parsing algorithms and used widely in practical applications. Nonetheless the theory of construction of these parsing algorithms is not understood widely. While most textbooks of compiler construction or automata theory mention LR parsing, the correctness proofs of the construction algorithms of LR parsers and LR parsing algorithms are omitted usually. Even in the texts which describe the theory and proofs in detail, developments of the theory are mainly procedural and it is not easy to understand them intuitively. In this research, after the line of Cousot and Cousot``s works, we represented LR(k) and LL(k) parsing algorithms as abs... | eng |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.subject | Formal semantics | - |
dc.subject | LL parsing | - |
dc.subject | LR parsing | - |
dc.subject | Formal languages | - |
dc.subject | Abstract interpretation | - |
dc.subject | 요약해석 | - |
dc.subject | 형식의미론 | - |
dc.subject | LL 구문분석 | - |
dc.subject | LR 구문분석 | - |
dc.subject | 형식언어 | - |
dc.title | (An) LR(k) and LL(k) parsing framework: abstract interpretation approach | - |
dc.title.alternative | LR(k) 및 LL(k) 구문분석 프레임웍에 대한 요약해석적 접근 | - |
dc.type | Thesis(Ph.D) | - |
dc.identifier.CNRN | 258165/325007 | - |
dc.description.department | 한국과학기술원 : 전산학전공, | - |
dc.identifier.uid | 000975211 | - |
dc.contributor.localauthor | Choe, Kwang-Moo | - |
dc.contributor.localauthor | 최광무 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.