Regular and Context-Free Languages (AQA A-Level Computer Science): Quizzes
📚Quizzes
Practise the questions
10 questions from this quiz
ShowHide
Practise the questions
10 questions from this quiz
What does the * operator mean in a regular expression?
What does the * operator mean in a regular expression?
Zero or more of the preceding element
What does the + operator mean in a regular expression?
What does the + operator mean in a regular expression?
One or more of the preceding element
What does the ? operator indicate in a regular expression?
What does the ? operator indicate in a regular expression?
Zero or one (optional) element
What is the relationship between regular expressions and finite state machines?
What is the relationship between regular expressions and finite state machines?
Every regex can be represented as an FSM
In POSIX regex, what does the . (dot) operator match?
In POSIX regex, what does the . (dot) operator match?
Any single character
Why can't regular expressions handle binary palindromes?
Why can't regular expressions handle binary palindromes?
They can't remember earlier chars to match
In BNF notation, what does the ::= symbol mean?
In BNF notation, what does the ::= symbol mean?
Is defined as
What is a terminal element in BNF?
What is a terminal element in BNF?
An element that can't be broken down
In syntax diagrams, what do ovals represent?
In syntax diagrams, what do ovals represent?
Terminal elements
What can context-free languages handle that regular expressions cannot?
What can context-free languages handle that regular expressions cannot?
Complex, hierarchical structures