Abstract
A language for specifying lexical scans is described.The language uses the model of a finite state automation with a limited back-up facility.It is efficiently implementable and is machine independent except for one statement which depends on the machine's character set.