Simple precedence grammar

A Simple precedence grammar is a context-free formal grammar that can be parsed with Simple precedence parser.

Formal definition

	S	a	b	c
S	${\dot {=}}$	${\dot {<}}$	${\dot {=}}$	${\dot {<}}$
a	${\dot {=}}$	${\dot {<}}$		${\dot {<}}$
b		${\dot {>}}$	${\dot {>}}$	${\dot {>}}$
c		${\dot {>}}$	${\dot {>}}$	${\dot {>}}$