1/9
Looks like no tags are added yet.
Name | Mastery | Learn | Test | Matching | Spaced |
---|
No study sessions yet.
syntax analysis
using tokens from lexical analysis to verify their usage
grammar
finite set of rules to create an infinite set of sentences via tokens
Context Free Grammar (CFG)
how tokens and language are combined
differentiate top-down from bottom-down parsing
top-down parsing starts from a high level construct to create tokens while bottom-down parsing uses tokens to create a root structure
Unlike regular languages, context free languages (CFL) have
infinite number of states, maintain memory, and can be recursed/nested
What are the tuples used in CFG?
V, ∑, S, R
V
non-terminal/placeholder symbols
∑
terminal symbols
S
start symbol
R
production rules