Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 206 views

    Week-2 Lecture 2 Lexical Analysis

    Uploaded by

    Adiba Ispahani
    This document discusses lexical analysis and finite state automata. It covers the following key points in 3 sentences: Finite state automata (FSA) are used to recognize languages defined by regular expressions. An FSA has a set of states, transitions between states labeled with input symbols, a start state, and final states. The document discusses nondeterministic finite automata (NFA) and deterministic finite automata (DFA), providing examples of how to represent regular expressions like (a|b)*abb using an NFA and DFA.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd

    Week-2 Lecture 2 Lexical Analysis

    Uploaded by

    Adiba Ispahani
    206 views15 pages
    This document discusses lexical analysis and finite state automata. It covers the following key points in 3 sentences: Finite state automata (FSA) are used to recognize languages defined by regular expressions. An FSA has a set of states, transitions between states labeled with input symbols, a start state, and final states. The document discusses nondeterministic finite automata (NFA) and deterministic finite automata (DFA), providing examples of how to represent regular expressions like (a|b)*abb using an NFA and DFA.

    Original Title

    Week-2 Lecture 2 Lexical Analysis.ppt

    Copyright

    © © All Rights Reserved

    Available Formats

    PPT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document discusses lexical analysis and finite state automata. It covers the following key points in 3 sentences: Finite state automata (FSA) are used to recognize languages defined by regular expressions. An FSA has a set of states, transitions between states labeled with input symbols, a start state, and final states. The document discusses nondeterministic finite automata (NFA) and deterministic finite automata (DFA), providing examples of how to represent regular expressions like (a|b)*abb using an NFA and DFA.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    206 views15 pages

    Week-2 Lecture 2 Lexical Analysis

    Uploaded by

    Adiba Ispahani
    This document discusses lexical analysis and finite state automata. It covers the following key points in 3 sentences: Finite state automata (FSA) are used to recognize languages defined by regular expressions. An FSA has a set of states, transitions between states labeled with input symbols, a start state, and final states. The document discusses nondeterministic finite automata (NFA) and deterministic finite automata (DFA), providing examples of how to represent regular expressions like (a|b)*abb using an NFA and DFA.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    of 15

    CSE420 Compiler Design

    Lecture: 3
    Lexical Analysis (Part 2)
    Finite State Automata (FSAs)
     AKA “Finite State Machines”, “Finite Automata”, “FA”
     A recognizer for a language is a program that takes as input a
    string x and answers “yes” if x is a sentence of the language and
    “no” otherwise.
     The regular expression is compiled into a recognizer by
    constructing a generalized transition diagram called a finite
    automaton.
     One start state
     Many final states
     Each state is labeled with a state name
     Directed edges, labeled with symbols
     Two types
     Deterministic (DFA)
     Non-deterministic (NFA)
    Nondeterministic Finite Automata
    A nondeterministic finite automaton (NFA) is a
    mathematical model that consists of

    1. A set of states S
    2. A set of input symbols 
    3. A transition function that maps state/symbol pairs
    to a set of states
    4. A special state s0 called the start state
    5. A set of states F (subset of S) of final states

    INPUT: string
    OUTPUT: yes or no
    Example – NFA : (a|b)*abb

    S = { 0, 1, 2, 3 } a
    start
    s0 = 0 0 a 1 b 2 b 3

    F={3}
    b
     = { a, b }

    input
     (null) moves possible
    s a b
    t 0 { 0, 1 } { 0 } i  j
    a 1
    t -- {2} Switch state but do not
    e 2 -- {3} use any input symbol

    Transition Table
    Deterministic Finite Automata

    A DFA is an NFA with the following restrictions:


    •  moves are not allowed
    • For every state s S, there is one and only one path
    from s for every input symbol a  .
    Since transition tables don’t have any alternative options, DFAs are easily
    simulated via an algorithm.
    Example – DFA : (a|b)*abb

    a b
    start
    0 a 1 b 2 b 3
    a
    b a
    What Language is Accepted?

    Recall the original NFA:

    a
    start
    0 a 1 b 2 b 3

    b
    DFA vs NFA
     Both DFA and NFA are the recognizers of regular
    sets.
     But – time-space trade space exists
     DFAs are faster recognizers
     Can be much bigger too..
    Converting Regular Expressions to NFAs
    Thompson’s Construction
     Empty string is a regular expression denoting {  }

    start i  f
     a is a regular expression denoting {a} for any a in 

    start i a f
    Converting Regular Expressions to NFAs
    If P and Q are regular expressions with NFAsNp, Nq:

    P | Q (union)

     Np 
    start
    i f
     Nq 
    PQ (concatenation)

    start
    i Np Nq f
    Converting Regular Expressions to NFAs

    If Q is a regular expression with NFA Nq:


    Q* (closure)

    start  Nq 
    i f


    NFA Construction
    RE: (a|b)*abb
    NFA Construction
    RE: (a|b)*abb
    H.W: Construct NFA for the following RE

    (ab*c) | (a(b|c*))
    NFA Construction
    id  letter ( letter | digit )*
    End of slide

    You might also like