CodeBus
www.codebus.net
Search
Sign in
Sign up
Hot Search :
Source
embeded
web
remote control
p2p
game
More...
Location :
Home
Search - INT 1
Main Category
SourceCode
Documents
Books
WEB Code
Develop Tools
Other resource
Search - INT 1 - List
[
ComboBox
]
fchh
DL : 0
一.实验目的 二.实验内容 三、程序简要说明 原 文 : C语言词法分析器的设计与实现 一.实验目的: 1.强化对系统软件综合工程实现能力、规划能力的训练; 2.加强对词法分析原理、方法和基本实现技术的理解; 二.实验内容: 用C语言(或 C++ )作为宿主语言完成: C语言(ANSI C或turbo C 2.0)词法分析器的设计和实现。 三、程序简要说明: 1、属性字说明: 共9种 KEYWORD: 关键字 \"auto\",\"break\",\"case\",\"char\",\"const\",\"continue\", \"default\",\"do\",\"double\",\"else\",\"enum\",\"extern\", \"float\",\"for\",\"goto\",\"if\",\"int\",\"long\",\"register\", \"return\",\"short\",\"signed\",\"sizeof\",\"static\",\"struct\", \"switch\",\"typedef\",\"union\",\"unsigned\",\"void\", \"volatile\",\"while\",\"include\",\"define\" 共34个 详见IsKeyWord()函数 NUMBER: 数字 包括十进制整数,八进制整数,二进制整数,十六进制整数 还可返回几种错误 详见IsNumber()函数 CONSTANT: 常量 宏定义标识符,不识别C++关键字const,简单处理一层宏定义。 详见IsDefined()函数 ...... 关键词 : 计算机 编译原理 c语言 词法分析器-one. Experiment 2. Experiment 3, procedures brief description of the original : C language lexical analyzer Design and Implementation of a. The experiment : 1. To strengthen the integrated system software engineering, planning capacity of training; 2. Lexical analysis on principle, and basic understanding of the technology; 2. Experiment : C (or C) as the host language completed : C language (ANSI C or Turbo C 2.0) lexical analyzer design and implementation. 3, brief description of procedures : 1, the word attribute : a total of nine species KEYWORD : keyword "auto" "break" and "case", "char", "const", "continue", "default", "do", "double", "else", "enum" "extern", "
Date
: 2008-10-13
Size
: 1.19kb
User
:
天空
[
ComboBox
]
耿5
DL : 0
oid move(char x,char y,struct H num[3]) /*Ò Æ ¯ µ Ä ¾ ß Ì å ¹ ý ³ Ì */ void hanoi(char x,char y,char z,int n,struct H num[3]) /*µ Ý ¹ é*/ void Init(void) /*³ õ Ê ¼ » ¯ */ void Close(void) /*Í ¼ Ð Î ¹ Ø ±Õ */ int computer=1 /*×Ô ¯ ¿ Ø Ö Æ Ó ë Ê Ö ¯ ¿ Ø Ö Æ µ Ä ±êÖ ¾ */ int speed=0 /*È « ¾ Ö ±ä Á ¿ speedÖ ÷Ò ª Ê Ç Ñ Ý Ê ¾ ¹ ý ³ Ì µ Ä Ë Ù È */-oid move (char x, y char, struct H num [3]) / * Ograve AElig Macr micro Auml frac34 szlig Igrave aring sup1 yacute sup3 Igrave * / void Hanoi (char x, char y, z char, int n, struct H num [3]) / * micro Yacute sup1 * / void Init (void) / * sup3 otilde Ecirc frac14 raquo Macr * / void Close (void) / * Iacute frac14 ETH Icirc sup1 Oslash Otilde * / int computer = 1 / * x Ocirc Macr Almost Oslash Ouml AElig Oacute euml Ecirc Ouml Macr Almost Oslash Ouml AElig micro Auml Ouml frac34 * / int speed = 0 / * Egrave laquo frac34 Ouml auml Aacute Almost speedOuml Ograve ordf Ecirc Ccedil Ntilde Yacute Ecirc frac34 sup1 yacute sup3 Igrave micro Auml Euml Ugrave Egrave * /
Date
: 2008-10-13
Size
: 25.16kb
User
:
耿敬东
[
ComboBox
]
耿5
DL : 0
oid move(char x,char y,struct H num[3]) /*Ò Æ ¯ µ Ä ¾ ß Ì å ¹ ý ³ Ì */ void hanoi(char x,char y,char z,int n,struct H num[3]) /*µ Ý ¹ é*/ void Init(void) /*³ õ Ê ¼ » ¯ */ void Close(void) /*Í ¼ Ð Î ¹ Ø ±Õ */ int computer=1 /*×Ô ¯ ¿ Ø Ö Æ Ó ë Ê Ö ¯ ¿ Ø Ö Æ µ Ä ±êÖ ¾ */ int speed=0 /*È « ¾ Ö ±ä Á ¿ speedÖ ÷Ò ª Ê Ç Ñ Ý Ê ¾ ¹ ý ³ Ì µ Ä Ë Ù È */-oid move (char x, y char, struct H num [3])/* Ograve AElig Macr micro Auml frac34 szlig Igrave aring sup1 yacute sup3 Igrave*/void Hanoi (char x, char y, z char, int n, struct H num [3])/* micro Yacute sup1*/void Init (void)/* sup3 otilde Ecirc frac14 raquo Macr*/void Close (void)/* Iacute frac14 ETH Icirc sup1 Oslash Otilde*/int computer = 1/* x Ocirc Macr Almost Oslash Ouml AElig Oacute euml Ecirc Ouml Macr Almost Oslash Ouml AElig micro Auml Ouml frac34*/int speed = 0/* Egrave laquo frac34 Ouml auml Aacute Almost speedOuml Ograve ordf Ecirc Ccedil Ntilde Yacute Ecirc frac34 sup1 yacute sup3 Igrave micro Auml Euml Ugrave Egrave* /
Date
: 2026-01-09
Size
: 25kb
User
:
[
ComboBox
]
13
DL : 0
问题很简单。选择一个进制B,按照该进制将被乘数、乘数、乘积分别转换成十进制。 然后判断等式是否成立。使得等式成立的最小-int alfafl a jalaw jal
Date
: 2026-01-09
Size
: 714kb
User
:
曹预建
CodeBus
is one of the largest source code repositories on the Internet!
Contact us :
1999-2046
CodeBus
All Rights Reserved.