Lecture

Constructing a Lexer: First Symbols

Description

This lecture covers the computation of 'nullable' and 'first' for regular expressions, the clarification for the first of concatenation, converting simple regular expressions into a lexer, handling white spaces and comments, skipping simple comments, the longest match rule, and token priority.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.