Computer Science 164 - Spring 1993 - Rowe - Midterm 1

Computer Science 164 - Spring 1993 - Rowe - Midterm 1 -...

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

View Full Document Right Arrow Icon
CS164 Spring 1993, MT1 CS 164, Spring 1993 Midterm #1 Professor Rowe Problem #1 (10 points; 1 point each) Circle T or F to indicate the true or false statements. T F The following grammar is ambiguous. S-->SaS S-->SbS S-->c T F It is possible to build a deterministic finite state automation for the language { a* b* } with only two states. T F We use a scanner to convert characters to tokens rather than having the parser do the conversion because it simplifies the parser and leads to smaller, more time efficient compilers. T F A sentential form is a string of terminals and non-terminals that can be derived from the distinguished start symbol. T F In OO93, two routines can have the same name or identifier. T F In constructing a compiler, it is a good idea to use a program, like flex or lex , because it simplifies the coding of a scanner. T F A shared library contains code that can be shared by several processes running different programs. T F Dynamically allocated space is placed in the heap. T F All objects in OO93 contain a pointer to an object that represents the class of the object. T
Background image of page 1

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

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 05/17/2009 for the course CS 164 taught by Professor Staff during the Spring '08 term at University of California, Berkeley.

Page1 / 5

Computer Science 164 - Spring 1993 - Rowe - Midterm 1 -...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online