原创力文档- 1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
- 2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击 这里二次下载。
- 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
- 4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
- 5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
- 6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
- 7、VIP文档为合作方或网友上传，每下载1次， 网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
第4 章功课谜底(国外英文资料)
第4 章作业答案(国外英文资料)
Chapter 4 analysis of lexical analysis
Construct the following formal corresponding DFA.
(1) 1 (0 | 1) * 101
The answer:
1) construct the NFA:
one
one
one
0
0/1
a.
X
B
Y
C
2) identify the NFA:
∑
Q
0
one
X [X]
[A] A
[A] A
[A] A
[A, B] B
[A, B] B
[A] C C
[A, B] B
[A] C C
[A] A
[A, B, Y] Y
[A, B, Y] Y
[A] C C
[A, B] B
3) the DFA:
2. Known to the NFA = ({x, y, z}, {0, 1}, M, {x}, {} z), including: M = {} z (x, 0), M (y, 0) = {x, y}, and M (z, 0) = {x, z}.
M (x, 1) = {x}, M (y, 1) = phi, M (z, 1) = {y}, construct the corresponding DFA.
The answer:
1) according to the mapping, the following NFA transformation matrix is:
0
one
x
z
x
y
The x, y,
z
X, z
y
2) turn to NFA:
3) determination:
Sigma Q
0
one
X [x]
[z]. A
X [x]
[A]
(x, z) B
[y] C
[x, z] [B]
(x, z) B
(x, y) E
[y] C
(x, y) E
(x, y) E
[x, y, z] F
X [x]
[x, y, z] [F]
[x, y, z] F
(x, y) E
Identify and minimize the following (a) and (b) :
(a) to be sure:
Sigma Q
a.
b
[0] [0]
[0, 1] 1
[1] 2
[0, 1] [1]
[0, 1] 1
[1] 2
[1] 2
[0] 0
To minimize:
? 0? {0, 1} {2}
Because: {0, 1} a = {1} {0, 1} b = {2}
? 1? {0, 1} {2}
0, 1, 2 states merge
(b) because the automaton (b) has been identified, it is minimized:
? 0? {1, 2, 3, 4, 5} {0}
Because {4} a = {0} {1, 2, 3, 5} a = {1, 2, 3, 5}
? 1? {1, 2, 3, 5} {4}, {0}
Because {1, 5} b = {4} {2, 3} b = {2, 3}
? 2? {1, 5} {2, 3} {4}, {0}
Because {2} a is equal to {1} {3} a is equal to {3}
? 3? {1, 5} {2} {3} {0}
Because {1, 5} a = {1, 5} {1, 5} b = {4} cant be broken up
? 4? {1, 5} {2} {3} {0}
Merge {1, 5} :
5. Construct a DFA, it receives Σ = {0, 1} all satisfy the following conditions on the string: every 1 0 directly with in
On the right. The formal expression of the language is given.
The answer:
1) the corresponding formal expression can be (0 | 10) *, and construct the corresponding DFA:
2) turn the DFA into a right linear grammar:
S - A | epsilon.
A - 0 | | 0 1 b
B - 0 a | 0
Give the following formal formula for the following grammar:
S - 0 | 1 b
A - 1 s | 1
B - 0
文档评论（0）