Changes

Context-free grammar (view source)

152 bytes removed , 19:38, May 14, 2012

add cross-reference to Backus-Naur Form

Line 1: Line 1: +

''An equivalent grammar [[Backus-Naur Form]] is often used for describing the syntax/grammar of programming languages.''

+

A '''Context-Free''' Grammar is a tuple (T, V, S, P);

T is a set of atomic symbols.

Line 23: Line 25:

::real-number → part . part

:}

−

~~Or in '''Backus-Naur notation''':~~

−

~~:<real-numbers> → <part> . <part>~~

−

~~:<part> → <digit> | <digit> <part>~~

−

~~:<digit> → 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9~~

−

~~The Backus-Naur form was discovered independently in the late 1950s by John Backus and Peter Naur.~~

[[category:linguistics]]

[[Category:Computer Science]]

SkipCaptcha

265

edits