2014compiler课件Ch5_2_2013章节(400KB).pptVIP

  • 11
  • 0
  • 约6.93千字
  • 约 19页
  • 2018-04-01 发布于未知
  • 举报
Chapter 5 Bottom –Up Parsing LR(1) Parsing Computer Science Technology Harbin Engineering University Simple LR(1) Parsing Uses DFA of set of LR(0) items as constructed in the previous section. The power of LR(0) is increased significantly. SLR(1) uses the next token of the input string to direct its actions. The input token is consulted before a shift to make sure that appropriate DFA transition exists. The Follow sets of nonterminals are used to decide if a reduction should be performed. This approach is powerful enough to parse almost all commonly occurring language constructs. Compiler *

文档评论(0)

1亿VIP精品文档

相关文档