Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. C H A P T E R T W O Syntax

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 2-2 Parse Tree for 352 As an Integer Figure 2.1

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 2-3 A Program Fragment Viewed As a Stream of Tokens Figure 2.2

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 2-4 A Simple Lexical Syntax for a Small Language, Jay Figure 2.3

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 2-5 Major Stages in the Compiling Process Figure 2.4

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 2-6 Skeleton Lexical Analysis Method That Returns Tokens Figure 2.5

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 2-7 Conventions for Writing Regular Expressions Figure 2.6

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 2-8 A Concrete Syntax for Assignments and Expressions Figure 2.7

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 2-9 Parse Tree for the Expression x+2*y Figure 2.8

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display Sketch of a Parse Tree for a Complete Program Figure 2.9

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display Two Different Parse Trees for the AmbExp 2 – 3 – 4 Figure 2.10

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display An Ambiguous If Statement Figure 2.11

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display The “Dangling Else” Grammatical Ambiguity Figure 2.12

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display EBNF-Based Parse Tree for the Expression x+2*y Figure 2.13

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display Syntax Diagram for Expressions with Addition Figure 2.14

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display Abstract Syntax for Expression, Assignment, and Loop Figure 2.15

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display (a) Structure of a Binary Node. (b) Abstract Syntax Tree for the Expression x+2*y Figure 2.16

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display Partially Completed Recursive Descent Parse for Assignments Figure 2.17

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display Algorithm for Writing a Recursive Parser from EBNF Figure 2.18

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display An Example Jay Program to Compute the nth Fibonacci Number Figure 2.19

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display Sketch of the Abstract Syntax of a Jay WhileStatement Figure 2.20