Related lectures (36)
Syntax Trees: Parse vs AST
Explains syntax trees, parse vs AST, while language syntax, AST classes, and grammar ambiguities.
Interpreters and Virtual Machines
Explores interpreters and virtual machines, discussing their advantages, types, and optimization techniques.
CYK Algorithm for Parsing General Grammars
Explores parsing general grammars using the CYK algorithm and Chomsky Normal Form.
CLP Parser Lab Presentation
Covers implementing a parser for transforming tokens into an Abstract Syntax Tree.
Interpreter: Arithmetic Expressions
Covers a simple functional language, abstract syntax trees, interpreting expressions, and desugaring.
Introduction to Computer Language Processing
Covers computer language processing, compilers, skills learned, and application examples.
CYK Parsing Algorithm for General Grammars
Introduces the CYK parsing algorithm for context-free grammars, explaining its handling of ambiguity and importance in parsing general grammars.
Introduction to Grammars
Introduces automata, regular languages limitations, context-free grammars, and balanced parentheses grammars.
Compiling Expressions
Covers the conversion of expressions, evaluation using stack machines, and bytecode generation.
Foundations of Software
Covers the basics of induction, syntax, abstract vs. concrete syntax, and operational semantics for Booleans.

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.