Professional Documents
Culture Documents
-Context-Free Grammars (CFG) refers to a concise notation for specifying possibly-infinite sets of strings.
Deriving Sentences
Sentence->Subject->Verb
Strings:
Subj->Cat
Subj->Dog
Verb->eats
Verb->walks
Syntactical Analysis/Parsing
-determines if the list of words is in the language of a grammar.
-If lexical analysis or lexing converts string to token list, syntactical analysis/parsing checks in the token
list has valid grammatical or syntactical structure.
Quiz:
List down the sentences that you can derive using the following strings:
Sentence->Subj->Verb
Subj->Teacher
Subj->Student
Subj->John
Verb->thinks
Verb->writes
Verb->teaches
Long Quiz
in
Introduction to Computer Science
Name:_______________________________ Score:______________
Instructor: R. Dacoco Date: 7/15/2016
I. GAP FILLING
Instructions: Give what is being asked for. Write your answers on the gap. Select your answers from the
pool (1 pt. each).
II. IDENTIFICATION
Instructions: Specify the meaning of the following acronyms/initialisms (1 pt. each).
21. CPU-
22. BD-
23. DVD-
24. CRT-
25. LCD-
26. ROM-
27. ALU-
28. PROM
29. EPROM-
30. EE-PROM
IV. ENUMERATION
Instructions: Enumerate what is being asked for (1 pt. each).
31-36 Types of Keyboard
37-43 Examples of automatic/direct input devices
44-47 Classifications of computers according to capacity
48-50 Classifications of computers according to data handled.
//end
Good luck!