equal
deleted
inserted
replaced
55 |
55 |
56 (i) Give a grammar that can recognise such boolean expressions |
56 (i) Give a grammar that can recognise such boolean expressions |
57 and (ii) give a sample string involving all rules given in 1.-4.~that |
57 and (ii) give a sample string involving all rules given in 1.-4.~that |
58 can be parsed by this grammar. |
58 can be parsed by this grammar. |
59 |
59 |
|
60 \item Given the regular expression |
60 |
61 |
|
62 \[(ab + a)\cdot (\ONE + b)\] |
|
63 |
|
64 there are two values for how this regular expression can recognise |
|
65 the string $ab$. Give both values and indicate which one is the |
|
66 POSIX value. |
|
67 |
|
68 \item \POSTSCRIPT |
61 \end{enumerate} |
69 \end{enumerate} |
62 |
70 |
63 \end{document} |
71 \end{document} |
64 |
72 |
65 %%% Local Variables: |
73 %%% Local Variables: |