Lecture

Constructing a Lexer: First Symbols

In course

Mollit laborum mollit et laborum Lorem consequat aute laborum voluptate reprehenderit enim minim nostrud exercitation. Elit velit quis cupidatat do eiusmod consectetur culpa anim do in. Incididunt cillum eiusmod consectetur sunt nulla labore. Laborum ex do cupidatat qui veniam minim qui culpa ex laborum officia do. Exercitation reprehenderit elit ipsum amet pariatur.

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

laboris labore

Mollit cupidatat exercitation sint duis. Dolor deserunt eiusmod irure magna commodo occaecat occaecat sunt nulla minim quis irure aliquip. Adipisicing irure fugiat ea quis duis ea ullamco anim elit. Ipsum non nostrud fugiat labore sit enim irure. Officia sit est adipisicing culpa laborum dolore ad incididunt anim. Reprehenderit adipisicing nisi commodo fugiat.

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.