Scribd Logo
Upload

Welcome to Scribd!

  • 7 views

    15 Derivations

    Uploaded by

    Hanin Carolina Villamizar Ramirez
    The document discusses derivations in formal language theory. It defines a derivation as a sequence of productions that generates a string from a grammar. Derivations can be represented as parse trees, with the start symbol as the root and productions adding children. An example is provided of leftmost and rightmost derivations for an arithmetic expression string, building the corresponding parse trees. While many derivations are possible, leftmost and rightmost are important for parser implementation.

    Copyright:

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

    15 Derivations

    Uploaded by

    Hanin Carolina Villamizar Ramirez
    7 views25 pages
    The document discusses derivations in formal language theory. It defines a derivation as a sequence of productions that generates a string from a grammar. Derivations can be represented as parse trees, with the start symbol as the root and productions adding children. An example is provided of leftmost and rightmost derivations for an arithmetic expression string, building the corresponding parse trees. While many derivations are possible, leftmost and rightmost are important for parser implementation.

    Original Description:

    Derivations

    Original Title

    15.Derivations

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document discusses derivations in formal language theory. It defines a derivation as a sequence of productions that generates a string from a grammar. Derivations can be represented as parse trees, with the start symbol as the root and productions adding children. An example is provided of leftmost and rightmost derivations for an arithmetic expression string, building the corresponding parse trees. While many derivations are possible, leftmost and rightmost are important for parser implementation.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    7 views25 pages

    15 Derivations

    Uploaded by

    Hanin Carolina Villamizar Ramirez
    The document discusses derivations in formal language theory. It defines a derivation as a sequence of productions that generates a string from a grammar. Derivations can be represented as parse trees, with the start symbol as the root and productions adding children. An example is provided of leftmost and rightmost derivations for an arithmetic expression string, building the corresponding parse trees. While many derivations are possible, leftmost and rightmost are important for parser implementation.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    of 25

    Derivations

    Arles Rodríguez
    [email protected]

    Facultad de Ciencias
    Departamento de Matemáticas
    Universidad Nacional de Colombia
    Definition: Derivation
    • A derivation is a sequence of productions

    • A derivation can be drawn as a tree:


    – Start symbol is the tree root
    – For a production add children to node
    Derivations: Example
    • Given the following grammar of arithmetic
    expressions:

    • Consider this String:


    Derivations: Example

    Grammar: 𝐸
    E
    -> E + E 𝐸 +¿ 𝐸
    -> E * E + E 𝐸 ∗ 𝐸 𝑖𝑑
    -> id * E + E
    -> id * id + E
    𝑖𝑑 𝑖𝑑
    -> id * id + id This is called the Parse Tree

    We can produce a derivation for the string and build the tree at the same time
    Derivations: Example

    • Begin with the start symbol


    E 𝐸

    Grammar:
    Derivations: Example

    • Production E goes to E + E
    E 𝐸
    -> E + E
    𝐸 +¿ 𝐸

    Grammar:
    Derivations: Example

    • Replace E by E * E
    E 𝐸
    -> E + E
    -> E * E + E
    𝐸 +¿ 𝐸
    𝐸 ∗ 𝐸

    Grammar:
    Derivations: Example

    • Replace E by id
    E 𝐸
    -> E + E
    -> E * E + E
    𝐸 +¿ 𝐸
    -> id * E + E 𝐸 ∗ 𝐸
    𝑖𝑑

    Grammar:
    Derivations: Example

    • Replace E by id
    E 𝐸
    -> E + E
    -> E * E + E
    𝐸 +¿ 𝐸
    -> id * E + E 𝐸 ∗ 𝐸
    -> id * id + E
    𝑖𝑑 𝑖𝑑

    Grammar:
    Derivations: Example

    • Replace E by id
    E 𝐸
    -> E + E
    -> E * E + E
    𝐸 +¿ 𝐸
    -> id * E + E 𝐸 ∗ 𝐸 𝑖𝑑
    -> id * id + E
    -> id * id + id
    𝑖𝑑 𝑖𝑑

    Grammar:
    Derivations
    • A parse tree has:
    – Terminals at the leaves
    – Non-terminal at the interior nodes
    • An in-order transversal of the leaves is the
    original input.
    • The parse tree shows the association of
    operation, the input string does not.
    Derivations
    • The previous
    example corresponds
    E
    to a left-most -> E + E
    derivation:
    -> E * E + E
    – At each step replace
    -> id * E + E
    the left most non-
    -> id * id + E
    terminal.
    -> id * id + id
    Derivations
    • There is an
    equivalent notion of
    E
    right-most derivation -> E + E
    -> E + id
    -> E * E + id
    -> E * id + id
    -> id * id + id
    Derivations
    • There is an
    equivalent notion of
    right-most derivation
    𝐸
    E
    Derivations
    • There is an
    equivalent notion of
    right-most derivation
    𝐸
    E
    -> E + E
    𝐸 +¿ 𝐸
    Derivations
    • There is an
    equivalent notion of
    right-most derivation 𝐸
    E
    -> E + E
    𝐸 +¿ 𝐸
    -> E + id 𝑖𝑑
    Derivations
    • There is an
    equivalent notion of
    right-most derivation 𝐸
    E
    -> E + E
    𝐸 +¿ 𝐸
    -> E + id 𝐸 ∗ 𝐸 𝑖𝑑
    -> E * E + id
    Derivations
    • There is an
    equivalent notion of
    right-most derivation 𝐸
    E
    -> E + E
    𝐸 +¿ 𝐸
    -> E + id 𝐸 ∗ 𝐸 𝑖𝑑
    -> E * E + id
    𝑖𝑑
    -> E * id + id
    Derivations
    • There is an
    equivalent notion of
    right-most derivation 𝐸
    E
    -> E + E
    𝐸 +¿ 𝐸
    -> E + id 𝐸 ∗ 𝐸 𝑖𝑑
    -> E * E + id
    𝑖𝑑 𝑖𝑑
    -> E * id + id
    -> id * id + id
    Derivations
    • The right-most and left-most derivations
    have the same parse tree.
    • Every parse-tree has a right-most and left-
    most derivation.
    • There are many other derivations like random
    non-terminal selection but we most concern
    about right-most and left-most derivations.
    Exercise
    Exercise 2
    Summary
    • We are not just interested in whether
    – We need a parse tree for s
    • A derivation defines a parse tree
    – But one parse tree may have many derivations
    – We study left-most and right-most derivations
    since they are important in parser implementation.
    ¡Thank you!
    References
    • Aho et al. Compilers: principles, techniques, and
    tools. Torczon et al. (2014) (Section 4.2)
    • Slides are based on the design of Aiken Alex. CS 143.
    https://web.stanford.edu/class/cs143/

    You might also like