SkipCaptcha
265
edits
Changes
Jump to navigation
Jump to search
Line 1:
Line 1: + + Line 23:
Line 25: − − 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.
add cross-reference to Backus-Naur Form
''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);
A '''Context-Free''' Grammar is a tuple (T, V, S, P);
T is a set of atomic symbols.
T is a set of atomic symbols.
::real-number → part . part
::real-number → part . part
:}
:}
[[category:linguistics]]
[[category:linguistics]]
[[Category:Computer Science]]
[[Category:Computer Science]]