We can write a CFG for accepting si

We can write a CFG for accepting simple expressions
G = (V,T,P,S)
V = {E,F}
T = {0,1,a,b,+,*,(,)}
S = {E}
P:
E ==> E+E | E*E | (E) | F
F ==> aF | bF | 0F | 1F | a | b | 0 | 1

Hasil (Bahasa Indonesia) 1:

Kita dapat menulis CFG untuk menerima kalimat sederhanaG = (V, T, P, S)V = {E, F}T = {0,1,a,b,+,*,(,)}S = {E}P:E == > E + E | E * E | (E) | F F == > aF | bF | 0F | 1F | a | b | 0 | 1

Hasil (Bahasa Indonesia) 2:

Kita dapat menulis CFG untuk menerima ekspresi sederhana
G = (V, T, P, S)
V = {E, F}
T = {0,1, a, b, +, *, (,)}
S = {E }
P:
E ==> E + E | E * E | (E) | F
F ==> AF | bF | 0F | 1F | a | b | 0 | 1