Regular Expressions Flashcards
1
Q
What is BNF
A
A way of defining a complex language such as English unambiguously, need it because regular expressions don’t handles recursive loops well
2
Q
How do we write a variable
A
3
Q
How do we write is defined by
A
::=
4
Q
How do we write or
A
|
5
Q
How do we write a recursive loop
A
Identifier ::= |
