Upgrade to Pro — share decks privately, control downloads, hide ads and more …

UP Lecture 11

UP Lecture 11

Compilers
Midterm Review
(202602)

Javier Gonzalez-Sanchez PRO

December 14, 2023

Transcript

22 slides
  1. Dr. Javier Gonzalez-Sanchez | Compilers | 3 jgs Exam 01

    Monday Feb 23 (8:30 to 10pm GDL Time) Aula de Diseño 2 No lecture; solve your exam.
  2. Dr. Javier Gonzalez-Sanchez | Compilers | 7 jgs Disclaimer ▪

    The exam will include material from Lectures 01 to 07. ▪ This is NOT an exhaustive list of exam topics. ▪ This review covers only a subset of the material. ▪ The following slides provide examples related to selected topics. ▪ Be sure to review all lecture slides and course materials thoroughly.
  3. Dr. Javier Gonzalez-Sanchez | Compilers | 16 jgs Question For

    each case, indicate whether it is possible to generate a Deterministic Finite Automaton (DFA). 1. Can a DFA detect the balance of N parentheses in a string that contains N nested parentheses with any characters in between? 2. Is it possible for a DFA to recognize binary strings that contain an equal number of 0s and 1s, regardless of their order or sequence?
  4. Dr. Javier Gonzalez-Sanchez | Compilers | 19 jgs Syntax Diagram

    ▪ <TIME> = <TIME24> | <TIME12> ; ▪ <TIME24> = <DIGIT> <DIGIT> ":" <DIGIT> <DIGIT> ; ▪ <TIME12> = <HOUR12> [ ":" <DIGIT> <DIGIT> ] ("AM" | "PM") ; ▪ <HOUR12> = <DIGIT> | <DIGIT> <DIGIT> ; ▪ <DIGIT> = "0" | "1" | "2" | "3" | "4" | "5" | "6" | "7" | "8" | "9" ;
  5. jgs Compilers Javier Gonzalez-Sanchez, Ph.D. [email protected] Spring 2025 Copyright. These

    slides can only be used as study material for the Compilers course at Universidad Panamericana. They cannot be distributed or used for another purpose.

More Decks by Javier Gonzalez-Sanchez

Other Decks in Programming