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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

How do we write a variable

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

How do we write is defined by

A

::=

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

How do we write or

A

|

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

How do we write a recursive loop

A

Identifier ::= |

How well did you know this?
1
Not at all
2
3
4
5
Perfectly