Chapter 4_Context-Free Grammar (CFG)
0.0(0)
Studied by 2 people
Call Kai
Learn
Practice Test
Spaced Repetition
Match
Flashcards
Knowt PlayCard Sorting
1/6
There's no tags or description
Looks like no tags are added yet.
Last updated 12:59 PM on 11/13/25
Name | Mastery | Learn | Test | Matching | Spaced | Call with Kai |
|---|
No analytics yet
Send a link to your students to track their progress
7 Terms
1
New cards
Context-Free Grammar
A more powerful method of describing languages.
2
New cards
Context-Free Grammar
First used in the study of human languages.
3
New cards
Context-Free Grammar
its application occurs in the specification and compilation of programming languages.
4
New cards
Parser
a component that most compilers and interpreters have.
5
New cards
Parser
extracts the meaning of a program before generating the compiled code
6
New cards
Variables,
terminals,
production rules,
start variables
Grammar : (V, T, P, S)
Where
V : finite set of variables
T : finite set of terminals
P : finite set of production rules
S : start variables
7
New cards
can be rewritten as,
produces
The symbol "⟶" is read: (2)
Note 
Flashcards (42)