(A) new analysis of LALR formalisms = LALR fomalism 에 관한 새로운 분석

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 401
  • Download : 0
In traditional methods of computing LR(O) states and LALR(K) lookahead sets, certain relationships between nonterminals in the grammar are repeatedly re-examined, and the values dependent only on these relationships are repeatedly re-computed. Based on a new formalism of park, a new method is devised in which (by factoring out path) the relationships are examined once and the values are pre-computed. This results in time and/or space saving for the LR(O) states and LALR(K) lookahead sets computation. Experimental results including comparison with known methods of others are presented with respect to time and storage characteristics in construction of canonical collection of LR(O) state and computation of LALR(1) lookahead sets.
Advisors
Park, Chul-Hui박철희
Description
한국과학기술원 : 전산학과,
Publisher
한국과학기술원
Issue Date
1984
Identifier
60850/325007 / 000765127
Language
eng
Description

학위논문(박사) - 한국과학기술원 : 전산학과, 1984.2, [ [v], 78 p. ]

Keywords

LALR.

URI
http://hdl.handle.net/10203/32952
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=60850&flag=dissertation
Appears in Collection
CS-Theses_Ph.D.(박사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0