- 1
- 0
- 约1.83万字
- 约 71页
- 2017-06-22 发布于北京
- 举报
Introduction The scanning, or lexical analysis phase, reads the source program as a stream of characters and divides them into tokens. This is a special case of pattern matching Need to study methods of pattern specification and recognition Regular expressions Finite automata The scanner must operate as efficiently as possible. Introduction (cont ) Tokens Logical units that the scanner generates. Example: a[index] = 4 + 2; a identifier [ left bracket index identifier
原创力文档

文档评论(0)