1 / 17

180 likes | 394 Vues

Lecture 2: Introduction to Syntax. (Revised based on the Tucker’s slides). Thinking about Syntax. The syntax of a programming language is a precise description of all its grammatically correct programs. Precise syntax was first used with Algol 60, and has been used ever since. Three levels:

Télécharger la présentation
## Lecture 2: Introduction to Syntax

**An Image/Link below is provided (as is) to download presentation**
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.
Content is provided to you AS IS for your information and personal use only.
Download presentation by click this link.
While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

**Lecture 2: Introduction to Syntax**(Revised based on the Tucker’s slides) CS485, Lecture 2 Syntax**Thinking about Syntax**• The syntax of a programming language is a precise description of all its grammatically correct programs. • Precise syntax was first used with Algol 60, and has been used ever since. • Three levels: • Lexical syntax • Concrete syntax • Abstract syntax CS485, Lecture 2 Syntax**Levels of Syntax**• Lexical syntax = all the basic symbols of the language (names, values, operators, etc.) • Concrete syntax = rules for writing expressions, statements and programs. • Abstract syntax = internal representation of the program, favoring content over form. E.g., • C: if ( expr ) ... discard ( ) • Ada: if ( expr ) then discard then CS485, Lecture 2 Syntax**2.1 Grammars**• A metalanguage is a language used to define other languages. • A grammar is a metalanguage used to define the syntax of a language. • Our interest: using grammars to define the syntax of a programming language. CS485, Lecture 2 Syntax**2.1.1 Backus-Naur Form (BNF)**• Stylized version of a context-free grammar (cf. Chomsky hierarchy) • Sometimes called Backus Naur Form • First used to define syntax of Algol 60 • Now used to define syntax of most major languages CS485, Lecture 2 Syntax**BNF Grammar**• G = {P,T,N S} where set of productions: P terminal symbols: T nonterminal symbols: N start symbol: • A production has the form whereand CS485, Lecture 2 Syntax**A binary string is a string consisting of any**number of binary digits (0 or 1). So G_{binary}={P, {0,1}, {binary, binaryDigit}, binary} P consists of binary { binaryDigit } * , where {..}* are metacharacters that represent the repetition. binaryDigit 0 binaryDigit 1 Or the last two are equivalent to:binaryDigit 0 | 1 Here, | is a metacharacter that separates alternatives. Example: Binary String CS485, Lecture 2 Syntax**Consider the grammar:**IntegerDigit | Integer Digit Digit 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 We can derive any unsigned integer, like 352, from this grammar. 2.1.2 Derivations CS485, Lecture 2 Syntax**A 6-step process, starting with:**Integer Derivation of 352 as an Integer CS485, Lecture 2 Syntax**Use a grammar rule to enable each step:**Integer Integer Digit Derivation of 352 (step 1) CS485, Lecture 2 Syntax**Replace a nonterminal by a right-hand side of one of its**rules: Integer Integer Digit Integer 2 Derivation of 352 (steps 1-2) CS485, Lecture 2 Syntax**Each step follows from the one before it.**Integer Integer Digit Integer 2 Integer Digit 2 Derivation of 352 (steps 1-3) CS485, Lecture 2 Syntax**Integer Integer Digit** Integer 2 Integer Digit 2 Integer 5 2 Derivation of 352 (steps 1-4) CS485, Lecture 2 Syntax**Integer Integer Digit** Integer 2 Integer Digit 2 Integer 5 2 Digit 5 2 Derivation of 352 (steps 1-5) CS485, Lecture 2 Syntax**You know you’re finished when there are only terminal**symbols remaining. Integer Integer Digit Integer 2 Integer Digit 2 Integer 5 2 Digit 5 2 3 5 2 Derivation of 352 (steps 1-6) CS485, Lecture 2 Syntax**Integer Integer Digit** Integer Digit Digit Digit Digit Digit 3 Digit Digit 3 5 Digit 3 5 2 This is called a leftmost derivation, since at each step the leftmost nonterminal is replaced. (The first one was a rightmost derivation.) A Different Derivation of 352 CS485, Lecture 2 Syntax**Notation for Derivations**• Integer * 352 Means that 352 can be derived in a finite number of steps using the grammar for Integer. • 352 L(G) Means that 352 is a member of the language defined by grammar G. (You ONLY need to find ONE derivation) • L(G) = { T* | Integer * } Means that the language defined by grammar G is the set of all symbol strings that can be derived as an Integer. CS485, Lecture 2 Syntax

More Related