equal
deleted
inserted
replaced
77 \] |
77 \] |
78 |
78 |
79 Does simplification always preserve the meaning of a regular |
79 Does simplification always preserve the meaning of a regular |
80 expression? |
80 expression? |
81 |
81 |
82 \item The Sulzmann algorithm contains the function $mkeps$ |
82 \item The Sulzmann \& Lu algorithm contains the function $mkeps$ |
83 which answers how a regular expression can match the |
83 which answers how a regular expression can match the |
84 empty string. What is the answer of $mkeps$ for the |
84 empty string. What is the answer of $mkeps$ for the |
85 regular expressions: |
85 regular expressions: |
86 |
86 |
87 \[ |
87 \[ |
91 (a + \varepsilon) \cdot (\varepsilon + \varepsilon) |
91 (a + \varepsilon) \cdot (\varepsilon + \varepsilon) |
92 \end{array} |
92 \end{array} |
93 \] |
93 \] |
94 |
94 |
95 \item What is the purpose of the record regular expression |
95 \item What is the purpose of the record regular expression |
96 in the Sulzmann algorithm? |
96 in the Sulzmann \& Lu algorithm? |
97 |
97 |
98 |
98 |
99 %\item (Optional) The tokenizer in \texttt{regexp3.scala} takes as |
99 %\item (Optional) The tokenizer in \texttt{regexp3.scala} takes as |
100 %argument a string and a list of rules. The result is a list of tokens. Improve this tokenizer so |
100 %argument a string and a list of rules. The result is a list of tokens. Improve this tokenizer so |
101 %that it filters out all comments and whitespace from the result. |
101 %that it filters out all comments and whitespace from the result. |