1. (2pts) Briefly describe what a lexeme and a token is. 2. (2pts) When can a...

Transcribed Image Text:

1. (2pts) Briefly describe what a lexeme and a token is. 2. (2pts) When can a parse tree be called "fully attributed"? 3. (2pts) Briefly describe the two levels of uses of operational semantics. 4. (2pts) In denotational semantics, what are the syntactic and semantic domains? 5. (2pts) What is the weakest precondition? 6. (10pts) Consider the following grammar: | ENDLINE ID "->" "," ID | "&" | "%" | *** Assume is the start symbol. Assume that all caps represents a token, quoted sequence of symbols lexemes, and angle brackets nonterminals. Also assume that the ENDLINE token is the groups of lexemes representing an end of line. The ID token represents ids in the "C" sense (start with letter or underscore, a sequence of alphanumeric and underscore characters). (a) Give a sentence in this language that is generated from at least 3 . (b) Show the left-most derivation for your sentence. (c) Show the right-most derivation for your sentence. (d) Show the parse tree for your sentence. 1. (2pts) Briefly describe what a lexeme and a token is. 2. (2pts) When can a parse tree be called "fully attributed"? 3. (2pts) Briefly describe the two levels of uses of operational semantics. 4. (2pts) In denotational semantics, what are the syntactic and semantic domains? 5. (2pts) What is the weakest precondition? 6. (10pts) Consider the following grammar: | ENDLINE ID "->" "," ID | "&" | "%" | *** Assume is the start symbol. Assume that all caps represents a token, quoted sequence of symbols lexemes, and angle brackets nonterminals. Also assume that the ENDLINE token is the groups of lexemes representing an end of line. The ID token represents ids in the "C" sense (start with letter or underscore, a sequence of alphanumeric and underscore characters). (a) Give a sentence in this language that is generated from at least 3 . (b) Show the left-most derivation for your sentence. (c) Show the right-most derivation for your sentence. (d) Show the parse tree for your sentence.

Answer rating: 100% (QA)

1 A lexeme is a sequence of characters in the source program that is matched by the pattern for a to... View the full answer