{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Assignment2.docx - Assignment2 Chapter 3 and Chapter 15 Due...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
Assignment2 Chapter 3 and Chapter 15 Due 10/01 Last Name: __________________ First Name: ___________________ NetID: ___________ Matching PartA 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Part A Matching Problems: Select one best choice for each question from the sample answers provided. Note: An answer may be used more than one question. Sample Answers for your choice: (1) Assertion, (2) Axiom, (3) Axiomatic Semantics, (4) Attribute Grammar, (5) BNF, (6) CFG, (7) Denotational Semanics, (8) Derivation, (9) Generator, (10) Lexeme, (11) Nonterminal, (12) Operational Semantics, (13) Parse Tree, (14) Precondition, (15) Postcondition, (16) Recognizer, (17) Syntax, (18) Semantics, (19) Sentence, (20) Sentential Form, (21) Terminal, (22) Weakest precondition Question #01. _____ is equivalent to context-free grammars developed by John Backus #02. _____ is lexeme or token, and shows only in right-hand side of a grammar rule #03. _____ is a repeated application of grammar rules, from a start-symbol, ending with a input sentence #04. _____ is based on formal logic (predicate calculus) #05. _____ is a hierarchical (diagram) representation of a derivation #06. _____ is the string of symbols (nonterminals and terminals) in a derivation #07. _____ is with additions to CFGs to carry some semantic info with the attributes of parse tree nodes
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}