Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

Computer Science A-Level > Theory of Computation > Flashcards

Theory of Computation Flashcards

1
Q

What name is given to the rules that define how symbols can be replaced by other symbols?

A

Production rules

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

What type of object is enclosed in angle brackets in BNF?

A

Non-terminal

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

Why can BNF represent some languages that regular expressions can’t?

A

BNF supports recursion & languages with counting

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

Computer Science A-Level (5 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions