languages.pptVIP

CS 540 George Mason University * How to Describe Tokens? Regular Languages are the most popular for specifying tokens Simple and useful theory Easy to understand Efficient implementations * Languages Let S be a set of characters. S is called the alphabet. A language over S is set of strings of characters drawn from S. * Example of Languages Alphabet English characters Language English sentences Alphabet ASCII Language C++ programs, Java, C# * Notation Languages are sets of strings finite sequence of characters Need some notation for specifying which sets we want * Notation For l