Locally least-cost error repair for LR-based parsersLR Parsing 방법에 의거한 국소적 최적화 오류 수정

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 528
  • Download : 0
Explicit formula and efficient computing algorithm for the least-cost insertion string in the LR-based error repair scheme are presented. The formula for the least-cost insertion string is derived from the expected vocabulary string which is an extension of LALR lookahead sets. Based on a new LALR formalism[PCC85], an efficient algorithm for the expected vocabulary string is devised. This scheme can be viewed as an improvement of Fischer, et al.``s scheme[FDM79]. In order to compare with their method, we have implemented an error repair table constructor by modifying their parser generator(ECP). Experimental results including comparison are presented with respect to time and space characteristics in construction of the error repair table and computation of the locally least-cost repair in LR-based parsers.
Advisors
Chon, Kil-Nam전길남
Description
한국과학기술원 : 전산학과,
Publisher
한국과학기술원
Issue Date
1985
Identifier
60901/325007 / 000775131
Language
eng
Description

학위논문(박사) - 한국과학기술원 : 전산학과, 1985.8, [ [iv], 76 p. ]

Keywords

LR.

URI
http://hdl.handle.net/10203/32956
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=60901&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