English  |  正體中文  |  简体中文  |  Items with full text/Total items : 55184/89457 (62%)
Visitors : 10670724      Online Users : 71
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/37723


    Title: Parsing strong LL(k) languages with a modified LL(1) parsing table and a lookahead table
    Authors: 劉虎城;林尤
    Contributors: 淡江大學資訊工程學系
    Keywords: 剖析表;正則剖析法;文法;語法分析;編譯器;Parsing Table;Canonical Parsing;Grammar;Syntax Analysis;Compiler
    Date: 1991-12
    Issue Date: 2010-01-11 14:03:36 (UTC+8)
    Abstract: Traditionally, we shall not construct a parsing table for a strong LL(k) grammar for k>1, because a canonical parsing table for such a grammar is too space-consuming to construct a real one. But we observe that parsing a string in the strong LL(k) language is not always necessary to construct a huge parsing table. In many cases, a string in the strong LL(k) language can be parsed successfully with a modified parsing table whose size is the same as that of an LL(1) and a small lookahead table. In this paper, we present a parsing technique to parse the strong LL(k) languages with a modified LL(1) parsing table and a lookahead table. Two algorithms are given to show the canonical parsing method for a strong LL(k) grammar. We present another two algorithms to illustrate how to construct a modified LL(1) parsing table and a lookahead table and how to parse strong LL(k) languages with these two tables. Our method can reduce the parsing table size considerably, of course, will reduce the ability of handling error recovery, too. An error recovery scheme is proposed to remedy this weakness. Several practical methods that can be used to parse strong LL(k) languages are also compared. Finally, we discuss how to apply this method to parse LR(k) languages with a similar modified LR(1) parsing table and a lookahead table.
    Relation: 中華民國八十年全國計算機會議論文集(二)=Proceedings of National Computer Symposium 1991, Republic of China, Vol 2,頁714-719
    Appears in Collections:[Graduate Institute & Department of Computer Science and Information Engineering] Proceeding

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML99View/Open
    Parsing+Strong+LL(k)+Languages+with+a+Modified+LL(1)+Parsing+Table+and+a+Lookahead+Table_英文摘要.pdf90KbAdobe PDF146View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback