Scribd Logo
Upload

Welcome to Scribd!

  • BNF Grammar For PL

    Uploaded by

    Irving Jesus Sanchez Campos
    37 views2 pages
    This document contains BNF grammars that define the syntax of the PL/0 programming language. The standard BNF defines syntax rules for program structure, constant and variable declarations, procedures, and statements. The extended BNF adds optional and repeated elements to the grammar using square brackets and curly brackets.

    Original Description:

    Original Title

    BNF GRAMMAR FOR PL

    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 BNF grammars that define the syntax of the PL/0 programming language. The standard BNF defines syntax rules for program structure, constant and variable declarations, procedures, and statements. The extended BNF adds optional and repeated elements to the grammar using square brackets and curly brackets.

    Copyright:

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

    BNF Grammar For PL

    Uploaded by

    Irving Jesus Sanchez Campos
    This document contains BNF grammars that define the syntax of the PL/0 programming language. The standard BNF defines syntax rules for program structure, constant and variable declarations, procedures, and statements. The extended BNF adds optional and repeated elements to the grammar using square brackets and curly brackets.

    Copyright:

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

    BNF GRAMMAR FOR PL/0

    --------------------

    <program> ::= <block> .

    <block> ::= <const-decl> <var-decl> <proc-decl> <statement>

    <const-decl> ::= const <const-assignment-list> ; | e

    <const-assignment-list> ::= <ident> = <number>


    | <const-assignment-list> , <ident> = <number>

    <var-decl> ::= var <ident-list> ; | e

    <ident-list> ::= <ident> | <ident-list> , <ident>

    <proc-decl> ::= <proc-decl> procedure <ident> ; <block> ; | e

    <statement> ::= <ident> := <expression>


    | call <ident>
    | begin <statement-list> end
    | if <condition> then <statement>
    | while <condition> do <statement>
    | e

    <statement-list> ::= <statement> | <statement-list> ; <statement>

    <condition> ::= odd <expression> | <expression> <relation> <expression>

    <relation> ::= = | <> | < | > | <= | >=

    <expression> ::= <term> | <adding-operator> <term>


    | <expression> <adding-operator> <term>

    <adding-operator> ::= + | -

    <term> ::= <factor> | <term> <multiplying-operator> <factor>

    <multiplying-operator> ::= * | /

    <factor> ::= <ident> | <number> | ( <expression> )

    Notes.
    (1) "e" denotes the empty string.
    (2) <ident> and <number> are tokens representing identifiers and
    numbers,
    respectively.

    EXTENDED BNF GRAMMAR FOR PL/0


    -----------------------------

    <program> ::= <block> .

    <block> ::= <const-decl> <var-decl> <proc-decl> <statement>

    <const-decl> ::= [const <ident> = <number> {, <ident> = <number>} ;]


    <var-decl> ::= [var <ident> {, <ident>} ;]

    <proc-decl> ::= {procedure <ident> ; <block> ;}

    <statement> ::= <ident> := <expression>


    | call <ident>
    | begin <statement> {; <statement>} end
    | if <condition> then <statement>
    | while <condition> do <statement>
    | e

    <condition> ::= odd <expression> | <expression> <relation> <expression>

    <relation> ::= = | <> | < | > | <= | >=

    <expression> ::= [<adding-operator>] <term> {<adding-operator> <term>}

    <adding-operator> ::= + | -

    <term> ::= <factor> {<multiplying-operator> <factor>}

    <multiplying-operator> ::= * | /

    <factor> ::= <ident> | <number> | ( <expression> )

    Notes.
    (1) Optional constructions are enclosed in square brackets ([]).
    (2) Constructs repeated zero or more times are enclosed in curly
    brackets ({}).

    You might also like