C H A P T E R T W OPowerPoint PresentationSlide 3Slide 4Slide 5Slide 6Slide 7Slide 8Slide 9Slide 10Slide 11Slide 12Slide 13Slide 14Slide 15Slide 16Slide 17Slide 18Slide 19Slide 20Slide 21Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.C H A P T E R T W OSyntaxCopyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.2-2Parse Tree for 352 As an IntegerFigure 2.1Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.2-3A Program Fragment Viewed As a Stream of TokensFigure 2.2Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.2-4A Simple Lexical Syntax for a Small Language, JayFigure 2.3Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.2-5Major Stages in the Compiling ProcessFigure 2.4Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.2-6Skeleton Lexical Analysis Method That Returns TokensFigure 2.5Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.2-7Conventions for Writing Regular ExpressionsFigure 2.6Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.2-8A Concrete Syntax for Assignments and ExpressionsFigure 2.7Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.2-9Parse Tree for the Expression x+2*yFigure 2.8Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.2-10Sketch of a Parse Tree for a Complete ProgramFigure 2.9Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.2-11Two Different Parse Trees for the AmbExp 2 – 3 – 4 Figure 2.10Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.2-12An Ambiguous If StatementFigure 2.11Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.2-13The “Dangling Else” Grammatical AmbiguityFigure 2.12Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.2-14EBNF-Based Parse Tree for the Expression x+2*yFigure 2.13Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.2-15Syntax Diagram for Expressions with Addition Figure 2.14Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.2-16Abstract Syntax for Expression, Assignment, and LoopFigure 2.15Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.2-17(a) Structure of a Binary Node. (b) Abstract Syntax Tree for the Expression x+2*yFigure 2.16Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.2-18Partially Completed Recursive Descent Parse for AssignmentsFigure 2.17Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.2-19Algorithm for Writing a Recursive Parser from EBNFFigure 2.18Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.2-20An Example Jay Program to Compute the nth Fibonacci NumberFigure 2.19Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.2-21Sketch of the Abstract Syntax of a Jay WhileStatementFigure