Alan JoCFGs
Ways of specifying PL syntax
A context-free grammar is specified by a Tuple G = (V, T, P, S)
- V is variable (non-terminal symbol) set
- T is terminal (terminal symbol / Token (at compiler)) set - like alphabet
- P is production set - same head can exist
math: \subseteq V \times (V \cup U)^*
- S is one start symbol (sentence symbol) -
math: L(G) = \{w \in T^* \, | \, S \Rightarrow^* w\}
- Any Regular Languages is CFL
- process of replacing Non-terminals to terminals
- where V, T, P is finite set
Context Free Grammar Notion
Context Free Grammar Usages
![[Study] Context Free Grammar (CFG)](https://www.notion.so/image/https%3A%2F%2Ft1.daumcdn.net%2Ftistory_admin%2Fstatic%2Ftop%2Ffavicon_0630.ico?table=block&id=d1e67a59-d8b2-4181-9a8d-6a6c385d7878&cache=v2)
![[Study] Context Free Grammar (CFG)](https://www.notion.so/image/https%3A%2F%2Ft1.daumcdn.net%2Fcfile%2Ftistory%2F26058E4B515BD1E12D?table=block&id=d1e67a59-d8b2-4181-9a8d-6a6c385d7878&cache=v2)