Programming Languages Chapter 2 Syntax程序设计语言2章语法.pptVIP

2.2 Extended BNF (EBNF) BNF: recursion to represent iteration EBNF: additional metacharacters represent iteration { } braces: show a series of zero or more occurrences ( ) parens: pick exactly one from the enclosed list [ ] brackets: pick zero or one from the enclosed list How are metacharacters distinguished from terminal symbols? Compare BNF/EBNF Examples BNF Expr → Term | Exp + Term | Exp - Term IfStatement →if ( Exp ) Statement | if ( Exp ) Statement else Statement EBNF Expr → Term { ( + | - ) Term } IfStatement →if ( Expr ) Statement [ else Statement ] C-style EBNF C-style EBNF lists alternatives on separate lines and uses opt to signify optional parts. e.g., IfStatement: if ( Expression ) Statement ElsePartopt ElsePart: else Statement EBNF to BNF We can always rewrite an EBNF grammar as a BNF grammar. e.g., A → x { y } z can be rewritten: A → x A z A → ε | y A (Rewriting EBNF rules with ( ), [ ] is left as an exercise.) Syntax Diagram for Expressions with Addition – Figure 2.6 Syntax diagrams are another way to describe grammar rules. Popularized when they were used to describe Pascal grammar. All Three are Equally Powerful BNF is considered equivalent to context-free grammars because it can express any rule in the grammar EBNF is no more (or less) powerful or expressive than BNF. Its virtue is compactness. Syntax diagrams are equally expressive. Summary Preview Grammars BNF notation Grammars parse trees Grammars, parse trees, associativity precedence Ambiguity in grammars Next up: Clite syntax Lexical and concrete syntax Compilers interpreters Abstract syntax Can you construct another tree for this expression, perhaps using expr - expr – term as the first derivation? Copyright ? 2006 The McGraw-Hill Companies, Inc. Programming Languages2nd editionTucker and Noonan Chapter 2 Syntax A language that is simple to parse for the compiler is also simple to parse for the human prog