Scribd Logo
Upload

Welcome to Scribd!

  • 8 views

    LL 1 Grammer

    Uploaded by

    Aadil Nazir
    LL(1) grammars cannot contain ambiguous or left-recursive productions. A grammar is LL(1) if for any production A → α|β, the FIRST sets of α and β are disjoint, at most one side derives the empty string, and if β derives the empty string, the FIRST set of α does not intersect with the FOLLOW set of A.

    Copyright:

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

    You might also like

    LL 1 Grammer

    Uploaded by

    Aadil Nazir
    8 views3 pages
    LL(1) grammars cannot contain ambiguous or left-recursive productions. A grammar is LL(1) if for any production A → α|β, the FIRST sets of α and β are disjoint, at most one side derives the empty string, and if β derives the empty string, the FIRST set of α does not intersect with the FOLLOW set of A.

    Original Description:

    Check the examples of LL1 Grammer here

    Original Title

    LL 1 grammer

    Copyright

    © © All Rights Reserved

    Available Formats

    PPT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    LL(1) grammars cannot contain ambiguous or left-recursive productions. A grammar is LL(1) if for any production A → α|β, the FIRST sets of α and β are disjoint, at most one side derives the empty string, and if β derives the empty string, the FIRST set of α does not intersect with the FOLLOW set of A.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as ppt, pdf, or txt
    8 views3 pages

    LL 1 Grammer

    Uploaded by

    Aadil Nazir
    LL(1) grammars cannot contain ambiguous or left-recursive productions. A grammar is LL(1) if for any production A → α|β, the FIRST sets of α and β are disjoint, at most one side derives the empty string, and if β derives the empty string, the FIRST set of α does not intersect with the FOLLOW set of A.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as ppt, pdf, or txt
    of 3

    Properties of LL(1)

    • No ambiguous or left recursive grammar can be


    LL(1).
    • Grammar G is LL(1) iff whenever A| are
    two distinct productions of G and:
    – For no terminal a do both  and  derive strings
    beginning with a.
    FIRST()FIRST()=
    – At most one of  and  can derive the empty string.
    – If , the  does not derive any string beginning
    with a* terminal in FOLLOW(A).
    FIRST(FOLLOW(A))FIRST(FOLLOW(A))=
    LL(1) Grammars: Example
    Non-LL(1) Grammar: Example

    You might also like