Scanner
The input to a scanner.
What is a string / a sequence of characters?
What tokens are called in a parser
What are terminal symbols?
The output of a scanner
What is a sequence of tokens?
The output of a parser
What are parse trees / abstract syntax trees?
Characters that form a word/token
What is a lexeme?
The phenomenon where a string may have two distinct derivations using the same grammar.
What is ambiguity?
An efficient way to implement scanners specified by regular expressions?
What is a finite automaton (more specifically, a DFA)?
A characteristic of grammars that make top-down parsers loop infinitely.
What is left/right-recursion?
Data which may be optionally attached to a token
What is the attribute of a token?
A class of grammars for which a recursive descent parser doesn't need to backtrack.
What is LL(1) grammar?
Technically, LL(k) for any k>=0 are grammars for which recursive descent parser doesn't need to backtrack.