Scribd Logo
Upload

Welcome to Scribd!

  • 338 views

    Quiz Tekkom (Compilation Technique) Binus University

    Uploaded by

    reindhartz
    1) The document discusses removing left recursion and left factoring from the regular expression (ab*a + a*b). 2) It asks to provide the parsing tree, transition table, and transition diagram for the regular expression (a | b)a(ab | a)*. 3) It provides the grammar S -> AbS | e | e and asks to find the Follow sets and construct the predictive parsing table. 4) It provides the grammar G -> S S -> (L) | a L -> SL' L'-> SL' | e and asks to find the First and Follow sets.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    Quiz Tekkom (Compilation Technique) Binus University

    Uploaded by

    reindhartz
    338 views1 page
    1) The document discusses removing left recursion and left factoring from the regular expression (ab*a + a*b). 2) It asks to provide the parsing tree, transition table, and transition diagram for the regular expression (a | b)a(ab | a)*. 3) It provides the grammar S -> AbS | e | e and asks to find the Follow sets and construct the predictive parsing table. 4) It provides the grammar G -> S S -> (L) | a L -> SL' L'-> SL' | e and asks to find the First and Follow sets.

    Original Description:

    Quiz Tekkom from Binus University Teacher In Indonesian Language Difficulty Easy to Understand

    Original Title

    Quiz Tekkom (Compilation Technique) Binus University

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    1) The document discusses removing left recursion and left factoring from the regular expression (ab*a + a*b). 2) It asks to provide the parsing tree, transition table, and transition diagram for the regular expression (a | b)a(ab | a)*. 3) It provides the grammar S -> AbS | e | e and asks to find the Follow sets and construct the predictive parsing table. 4) It provides the grammar G -> S S -> (L) | a L -> SL' L'-> SL' | e and asks to find the First and Follow sets.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    338 views1 page

    Quiz Tekkom (Compilation Technique) Binus University

    Uploaded by

    reindhartz
    1) The document discusses removing left recursion and left factoring from the regular expression (ab*a + a*b). 2) It asks to provide the parsing tree, transition table, and transition diagram for the regular expression (a | b)a(ab | a)*. 3) It provides the grammar S -> AbS | e | e and asks to find the Follow sets and construct the predictive parsing table. 4) It provides the grammar G -> S S -> (L) | a L -> SL' L'-> SL' | e and asks to find the First and Follow sets.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    of 1

    1) a. RE : ( ab*a + a*b ) aa bikin e-NFA nya b.

    Q -> QDE | q D -> NAF | dFA | d N -> DAF | n F -> f A -> a E -> e Cari Left Recursion and Left Factoring nya 2) RE : ( a | b ) a ( ab | a )* a) Parsing Tree b) Transition Table c) Diagram Transition 3) S -> AbS | e | e(empty) A -> a | cAd Follow (S) = {e(empty)} Follow (A) = {b,d} a) Predictive Parsing Table b) Telusuri String cadb 4) G -> S S -> (L) | a L -> SL' L'-> SL' | e(empty) Cari First dan Follow Setnya

    You might also like