COMPILER DESIGN

INTERMEDIATE CODE GENERATION

SYNTAX TREES

Question [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
A regular expression for accepting strings with exactly one 1 more than 0’s is
A
0*1
B
(0|1)*1(0|1)*
C
(0|1)*1(0|1)*|1(0|1)*
D
Not possible
Explanation: 
There is 1 question to complete.