SkipCaptcha
265
edits
Changes
mLine 193:
Line 193: − +
→Discussion: more appropriate link
One of the limitations of a regular grammar is that it can't cope with nested matching brackets, so that it is impossible to write a regular grammar to describe an expression such as '''2 * (3+4)''' where that grammar is expected to allow brackets nested to any depth. A context-free grammar is needed for this, as described in the next section.
One of the limitations of a regular grammar is that it can't cope with nested matching brackets, so that it is impossible to write a regular grammar to describe an expression such as '''2 * (3+4)''' where that grammar is expected to allow brackets nested to any depth. A context-free grammar is needed for this, as described in the next section.
Regular grammars or equivalent are widely used during [[compilation]] in the lexical analysis of programming languages.
Regular grammars or equivalent are widely used by [[compiler]]s in the lexical analysis of programming languages.
===Level 2===
===Level 2===