CSCE 314 Past Quiz Questions with correct answers 2024_2025
1 view 0 purchase
Course
CSCE
Institution
CSCE
Typical programming language implementation involves the following (unordered) major steps.
Which step would result in a type-annotated parse tree?
a. Parsing
b. Type checking
c. Optimization
d. Machine code generation
e. Lexical analysis
b. Type checking
Typical programming language ...
CSCE 314 Past Quiz Questions with
correct answers 2024/2025
Typical programming language implementation involves the following
(unordered) major steps.
Which step would result in a type-annotated parse tree?
a. Parsing
b. Type checking
c. Optimization
d. Machine code generation
e. Lexical analysis - ANSWER- b. Type checking
Typical programming language implementation involves the following unordered
major steps.
Correctly order the steps, in which a language system generates an executable
code from given source code.
Machine code generation
Lexical analysis
Parsing
Optimization
Type checking - ANSWER- 1. Lexical analysis
2. Parsing
3. Type checking
4. Optimization
5. Machine code generation
Typical programming language implementation involves the following
(unordered) major steps.
Which step generates a syntax tree, given a stream of tokens as input, by
checking whether the program is written according to the grammar?
a. Optimization
, b. Lexical analysis
c. Parsing
d. Type checking
e. Machine code generation - ANSWER- c. Parsing
Consider the following Haskell definition of the list Monad.
instance Monad [] where
-- (>>=) :: [a] -> (a -> [b]) -> [b]
xs >>= f = [y | x <- xs, y <- f x ]
Suppose that you are showing the step-by-step of the following expression
explaining how the >>= operator works:
[1,2] >>= \x -> [x..3] >>= \y -> return (y+1)
Which one of the following values is not a value of y while evaluating the above
expression?If every value is a value of y, then choose "All values are values of y."
1
2
3
4
All values are values of y - ANSWER- 4
Given the following declaration of Haskell class Functor.
class Functor f wherefmap :: (a -> b) -> f a -> f b
What can go in the underlined space below so that the Functor laws are
preserved?
instance Functor Maybe where
fmap _ Nothing = Nothing
fmap f (Just x) = __________
a. Just (f x)
b. f (Just x)
c. Just f x
d. f x
e. Just f
f. Just x - ANSWER- a. Just (f x)
Typical programming language implementation involves the following
(unordered) major steps.
Which step would generate a token table from a stream of characters?
The benefits of buying summaries with Stuvia:
Guaranteed quality through customer reviews
Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.
Quick and easy check-out
You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.
Focus on what matters
Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!
Frequently asked questions
What do I get when I buy this document?
You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.
Satisfaction guarantee: how does it work?
Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.
Who am I buying these notes from?
Stuvia is a marketplace, so you are not buying this document from us, but from seller tuition. Stuvia facilitates payment to the seller.
Will I be stuck with a subscription?
No, you only buy these notes for $11.49. You're not tied to anything after your purchase.
