Description: Complete the following regular grammar describes a subset of Pascal language word symbols of the lexical analysis process. < Identifier> → letters ︱ < identifier> Alphabet ︱ < identifier> number < unsigned integer> → Digital ︱ < unsigned integer> number < single-character delimiter> →+ ︱- ︱ ︱* ︱ (︱) < two-character delimiter> → < greater than> = ︱ < less than> = ︱ < less than> > ︱ < colon> = ︱ < oblique shaft> * < less than> → < < mean> → = < greater than> →> < colon> →: < oblique vertical> →/reserved words of the language: begin end if then else for do while and or not: 1 The language is not case sensitive. 2 letters az AZ, numbers 0-9
To Search:
- [cifa] - Construction principles of lexical analy
File list (Check if you may need any files):
新建 文本文档.cpp
Download