2.4 A language

The grammar (syntax) of a formal language L can be represented as a tuple: (N,Σ,P,S). The set of all the strings that can be described as S according to the syntax is denoted as L(G).