Tokens - Regular Expressions

Tokens - Regular Expressions

Qn: How are tokens defined and recognized?

Ans: By using regular expressions to define a token

as a formal regular language.

Formal Languages --

Alphabet - a finite set of symbols, ASCII is a

computer alphabet.

String - finite sequence of symbols from the alphabet.

Previous slide Next slide Back to the first slide View Graphic Version