Scribd Logo
Upload

Welcome to Scribd!

  • Asignment#3

    Uploaded by

    najma rasool
    16 views2 pages
    This document contains a grammar with non-terminals E, R, T, S, F and terminals n, +, *, (, ). It defines the following productions: E → TR, R → ε, R → +E, T → FS, S → ε, S → *T, F → n, F → (E). It then instructs the reader to make an LL(1) parsing table for this grammar and an SLR(1) parsing table for the grammar S → AA, A → aA | b.

    Original Description:

    Original Title

    asignment#3.docx

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document contains a grammar with non-terminals E, R, T, S, F and terminals n, +, *, (, ). It defines the following productions: E → TR, R → ε, R → +E, T → FS, S → ε, S → *T, F → n, F → (E). It then instructs the reader to make an LL(1) parsing table for this grammar and an SLR(1) parsing table for the grammar S → AA, A → aA | b.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    16 views2 pages

    Asignment#3

    Uploaded by

    najma rasool
    This document contains a grammar with non-terminals E, R, T, S, F and terminals n, +, *, (, ). It defines the following productions: E → TR, R → ε, R → +E, T → FS, S → ε, S → *T, F → n, F → (E). It then instructs the reader to make an LL(1) parsing table for this grammar and an SLR(1) parsing table for the grammar S → AA, A → aA | b.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 2

    Heritage College Chishtian

    Compiler BSCS 5th


    Assigment#3
    Make LL(1), parsing table of the given grammar

    1. E → T R
    2. R → ε
    3. R → + E
    4. T → F S
    5. S → ε
    6. S → * T
    7. F → n
    8. F → ( E )

    E → TR

    R → ε

    R → +E

    T → FS

    S → ε

    S → *T

    F → n

    F → (E)
    Make parsing table of LR(0), SLR(1)
    S -> AA
    A -> aA | b

    You might also like