原创力文档- 1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
- 2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击 这里二次下载。
- 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
- 4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
- 5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
- 6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
- 7、VIP文档为合作方或网友上传，每下载1次， 网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
龙书第二章部分答案新
第二章
2.2 Exercises for Section 2.2
HYPERLINK /fool2fish/dragon-book-exercise-answers/blob/master/ch02/2.2/2.2.md#2212.2.1
Consider the context-free grammar:
S - S S + | S S * | a
Show how the string aa+a* can be generated by this grammar.
Construct a parse tree for this string.
What language does this grammar generate? Justify your answer.
HYPERLINK /fool2fish/dragon-book-exercise-answers/blob/master/ch02/2.2/2.2.md#answeranswer
S - S S * - S S + S * - a S + S * - a a + S * - a a + a *
L = {Postfix expression consisting of digits, plus and multiple signs}
HYPERLINK /fool2fish/dragon-book-exercise-answers/blob/master/ch02/2.2/2.2.md#2222.2.2
What language is generated by the following grammars? In each case justify your answer.
S - 0 S 1 | 0 1
S - + S S | - S S | a
S - S ( S ) S | ε
S - a S b S | b S a S | ε
? S - a | S + S | S S | S * | ( S )
HYPERLINK /fool2fish/dragon-book-exercise-answers/blob/master/ch02/2.2/2.2.md#answer-1answer
L = {0n1n | n=1}
L = {Prefix expression consisting of plus and minus signs}
L = {Matched brackets of arbitrary arrangement and nesting, includes ε}
L = {String has the same amount of a and b, includes ε}
？
HYPERLINK /fool2fish/dragon-book-exercise-answers/blob/master/ch02/2.2/2.2.md#2232.2.3
Which of the grammars in Exercise 2.2.2 are ambiguous
HYPERLINK /fool2fish/dragon-book-exercise-answers/blob/master/ch02/2.2/2.2.md#answer-2answer
No
No
Yes
Yes
Yes
HYPERLINK /fool2fish/dragon-book-exercise-answers/blob/master/ch02/2.2/2.2.md#2242.2.4
Construct unambiguous context-free grammars for each of the following languages. In each case show that your grammar is correct.
Arithmetic expressions in postfix notation.
Left-associative lists of identifiers separated by commas.
Right-associative lists of identifiers separated by commas.
Arithmetic expressions of integers and identifiers with the four binary operators +, - , *, /.
HYPERLINK /fool2fish/dragon-book-exercise-answers/blob/master/ch02/2.2/2.2.md#answer-3answer
1. E
文档评论（0）