编译原理试题a(Compiler principle questions a).doc

编译原理试题a(Compiler principle questions a).doc

  1. 1、本文档共22页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
编译原理试题a(Compiler principle questions a)

编译原理试题a(Compiler principle questions a) Compiler principles test questions A (1998 compiler principles) test questions (all answers must be written on the answer sheet) (2006.12.25) 1. (5 * 6 points) answer the following questions: 1. what is the S- attribute grammar? What is the L- attribute grammar? Whats the relationship between them? 2. what is a handle? What is a prime phrase? 3. what are the conditions for determining the entry statements of the base blocks when dividing the basic blocks of a program? 4. what is the content of the DISPLAY table at run time? Whats the function of it? 5. generate the target code for the following four element sequence: A:=B*C D:=E+F G:=A+D H:=G*2 Among them, H is the active variable of the base block exit, and R0 and R1 are available registers Two, (8 points) set S={0, 1} on the normal set S, by the last second characters for 1 of all strings, please give the word set corresponding to the regular formula, and construct a recognition of the normal set of DFA. Three, (6) write a grammar of the language for the L (G) anbmambn ={| m, n = 1}. Four, (8 points) for grammar G (E): E? T|E+T T? F|T*F F? (E) |i 1. write down the rightmost of the sentence pattern (T*F+i) and draw the syntax tree. 2. write the phrase, the direct phrase, the handle, and the element phrase. Five, (12 points) set grammar G (S): 1. constructs the FIRSTVT and LASTVT sets of non terminators; 2. construct precedence relation tables and precedence functions. Six, (9 points) the syntax of a DO-WHILE statement for a language is S ? do S (1) While E really false S (1) code E code Its semantics is interpreted as: For the bottom-up parser, the translation pattern of the sentence is constructed as follows: (1) write the generative form suitable for grammar guided translation; (2) write the semantic actions of each production type. Seven, (8 points) will statement if (AX) ù (B0) then, while, C0, do, C:=C+D; translate into four yuan type. Eight, (10 points) with basic block

您可能关注的文档

文档评论(0)

f8r9t5c + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

版权声明书
用户编号:8000054077000003

1亿VIP精品文档

相关文档