WHILE循环语句的翻译程序设计(简单优先法_三地址输出).doc资源-CSDN文库

5星 · 超过95%的资源需积分: 10 112 浏览量 2013-01-13 16:47:38 上传评论 1 收藏 120KB DOC 举报

资源推荐

资源详情

资源评论

目录

1 问题域描述..........................................3

2 文法及属性文法的描述.........................3

2.1 WHILE 循环语句的文法................................3

2.2 WHILE 循环语句的属性文法............................4

3 语法分析方法及中间代码形式的描述................4

3.1 语法分析方法........................................4

3.2 中间代码形式描述....................................6

4 编译系统的概要设计.................................7

4.1 词法分析............................................7

4.2 语法制导翻译........................................8

5 详细的算法描述.....................................8

5.1 文法设计...........................................8

5.2 算法描述...........................................8

5.3 源程序代码.........................................9

6 软件的调试过程和结果测试.........................19

6.1 调试过程............................................19

6.2 结果测试............................................19

7 使用说明............................................20

8 课设总结............................................20

9 参考文献.............................................22

武汉理工大学《编译原理》课程设计

这样我们就可对已知文法中的任意两个文法符号 X，Y 按其在举行中可能会出现的相

邻关系确定他们的优先关系。

3.1.2 简单优先法的缺点

对文法的要求高，而且也要把文法符号的关系首先表示出来，这普遍性不是太好。

{/** S w h i l e E d o { B }a = + 1 ; > ( b c )

# **/

/* S */ { N, N, N, N, N, N, N, N, N, N, N, N, N, N, N, N, N, N, N, N,

N, N, 1 },

/* w/ { N, N, 0, N, N, N, N, N, N, N, N, N, N, N, N, N, N, N, N, N,

N, N, N },

/* h*/ { N, N, N, 0, N, N, N, N, N, N, N, N, N, N, N, N, N, N, N, N,

N, N, N },

/* i/ { N, N, N, N, 0, N, N, N, N, N, N, N, N, N, N, N, N, N, N, N, -1,

N, N },

/* l/ { N, N, N, N, N, 0, N, N, N, N, N, N, N, N, N, N, N, N, N, N, N,

N, N },

/* e */ { N, N, N, N, N, N, 0, N, N, N, N, N, N, N, N, N, N, N, N, N,

N, N, N },

/* E*/ { N, N, N, N, N, N, N, 0, N, N, N, N, N, N, N, N, N, N, N, N,

N, N, N },

/* d*/ { N, N, N, N, N, N, N, N, 0, N, N, N, N, N, N, N, N, N, N, N,

N, N, N },

/* o*/ { N, N, N, N, N, N, N, N, N, 0, N, N, N, N, N, N, N, N, N, N,

N, N, N },

/* { { N, N, N, N, N, N, N, N, N, N, 0, N, N, N, N, N, N, N, N, N, N,

N, N },

/* A/ { N, N, N, N, N, N, N, N, N, N, N, N, N, N, N, N, N, N, 0, N, N,

N, N },

/*}*/ { N, N, N, N, N, N, N, N, N, N, N, N, N, N, N, N, N, N, N, N,

N, 0, N },

/* a */ { N, N, N, N, N, N, N, N, N, N, N, N, N, N, 0, N, N, 0, N, N,

N, N, N },

/* = */ { N, N, N, N, N, N, N, N, N, N, N, N, 0, N, N, N, N, N, N, N,

N, N, N },

/* + */ { N, N, N, N, N, N, N, N, N, N, N, N, N, N, N, 0, N, N, N, N,

N, N, N },

/* 1 */ { N, N, N, N, N, N, N, N, N, N, N, N, N, N, N, N, 0, N, N, N,

N, N, N },

/* ; */ { N, N, N, N, N, 1, N, N, N, N, N, N, N, N, N, N, N, N, N, N,

N, N, N },

/* > */ { N, N, N, N, N, N, N, N, N, N, N, N, N, N, N, N, N, N, N, 0,

N, N, N },

/* ( */ { N, N, N, N, N, N, N, N, N, N, N, 0, -1, N, N, N, N, N, N, N,

3

剩余17页未读，继续阅读

内容反馈

weixin_41548144

2017-12-27

非常完整！！！给大佬跪下了！！感谢！！！

Navie_not_Naive

粉丝: 0
资源: 3

最新资源

资源上传下载、课程学习等过程中有任何疑问或建议，欢迎提出宝贵意见哦~我们会及时处理！点击此处反馈

feedback-tip