00. Table of Contents

• 01. Review of Last Lecture
• 02. Two rules
• 03. The earliest match wins
• 05. Quantifiers are greedy
• 09. Regex Engines
• 10. The DFA Engine
• 11. The DFA Engine - An Example
• 12. The NFA Engine
• 13. The NFA Engine - An Example
• 14. Fanta Revisited
• 16. Greediness and backtracking
• 18. Greediness always favours matching
• 20. Greediness and alternation
• 21. Another Traditional NFA problem
• 22. Why use Traditional NFA?
• 23. Perl Options
• 24. Perl Options - Case Insensitive Matching
• 25. Perl Options - Global Searches and the Multi-Match Anchor
• 26. Perl Options - Free form regexes
• 27. Perl Options - Lookahead
• 28. Perl Options - Modifying Greediness
• 29. Perl Options - Variable Interpolation
• 30. Regexes can't do everything