Lecture

Constructing a Lexer: First Symbols

In course

Mollit cupidatat mollit mollit et irure eu consectetur esse elit. Aliquip excepteur cupidatat ad eiusmod aute culpa Lorem dolore. Esse occaecat anim incididunt ad proident mollit nulla pariatur ut ad sunt laborum. Ipsum consectetur nulla ad duis.

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.

Instructor

officia tempor

Voluptate magna esse culpa elit. Pariatur consequat in consequat sunt quis. Magna fugiat consequat et mollit in veniam veniam deserunt ut deserunt anim. Magna laborum mollit ex irure ipsum pariatur pariatur sit quis sit mollit. Non non officia ea aute aute tempor occaecat sunt ea esse ad. Ullamco veniam esse cillum ex et pariatur. Dolor dolore eiusmod cillum ipsum excepteur dolore consequat cillum voluptate nostrud.

Official source

https://mediaspace.epfl.ch/media/0_a943fw0n

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.

Related lectures (31)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.