Skip to main content

Formal Languages and Compilers

Automata, regular expressions, context-free grammars, parsing, code optimization. From UniTO LFT (88 hours of audio).

ArticlesPublished 6
Main Tag#compilatori

Prerequisites

  • Mathematical Logic

What you'll learn

  • Build DFA/NFA from regex
  • Implement a Left-to-Right (LL(1)) Parser
  • Understand LR(1) and bottom-up parsing
  • Understanding compiler phases

Notify articles from Federico Calo's blog on GitHub with Angular and Spring Boot integrationFormal Languages and Compilers

Receive an alert when a new article in this series is published.

Go to UniNotesUniversity SectionSuggest correction