编译原理紫龙书(Compilers:Principles,Techniques and Tools Second Edition)部分答案

3.3.2 : Describe the languages denoted by the following regular expressions:

2: 所有的由a和b组成的串。

3: This regular expression denotes the language that takes zero or many instances of “a” or “b” as the prefix, followed with an “a”, ended with a string in{aa,ab,ba,bb}.

3.3.5

6 All strings of a's and b's with an even number of a's and an odd number of b's.

 even_a_even_b →（aa|bb）*  ((ab|ba)(aa|bb)*(ab|ba)(aa|bb)*)*

even_a_odd_b→ b even_a_even_b  |  a (aa|bb)*(ab|ba) even_a_even_b

 

对于偶数个a和奇数个b构成的串，其第一个字符可能是a或b

（