Think you've got it?
Lexers & Grammars
1.What is a lexer?
2.Write a regular expression that will parse a valid first and last name where the first letter of the each name is capitalized (e.g. "Johnny James")
You can test your regular expression using the console below or a site like https://regexr.com/.
3.What is special about escaping characters in Racket's regex implementation?
4.What is one way that Context Free Grammars are different from Regular Expressions?
5.What are the obstacles in making our grammar unambiguous?
6.Given an unambiguous CFG and any valid input string, how many derivations exist for the input string?
7.Write a regex that will determine if an input string is an email address of the format [email protected] where onyen can only have alphanumeric characters.
8.Why is the LL(1) condition on grammars important when building parsers?
9.What the main steps in the big picture of building an interpreter?