Go to the source code of this file.
Data Structures | |
| struct | Word |
Functions | |
| f () | |
| g (Word *p) | |
| h () | |
| main () | |
Variables | |
| Word | words [] |
| int | x [][5] = { 1, 2, 3, 4, 0, { 5, 6 }, { 7 } } |
| int * | y [] = { x[0], x[1], x[2], 0 } |
|
|
Definition at line 30 of file init.c. 00030 {
00031 static char *keywords[] = {"if", "for", "else", "while", 0, };
00032 char **p;
00033
00034 for (p = keywords; *p; p++)
00035 printf("%s\n", *p);
00036 }
|
Here is the call graph for this function:
|
|
Definition at line 38 of file init.c. References h(), i, p, and printf(). 00040 {
00041 int i;
00042
00043 for ( ; p->codes[0]; p++) {
00044 for (i = 0; i < sizeof p->codes/sizeof(p->codes[0]); i++)
00045 printf("%d ", p->codes[i]);
00046 printf("%s\n", p->name);
00047 }
00048 h();
00049 }
|
Here is the call graph for this function:
|
|
Definition at line 51 of file init.c. References i, name, printf(), and words. Referenced by g(), and main(). 00052 {
00053 int i;
00054
00055 for (i = 0; i < sizeof(words)/sizeof(Word); i++)
00056 printf("%d %d %d %s\n", words[i].codes[0],
00057 words[i].codes[1], words[i].codes[2],
00058 &words[i].name[0]);
00059 }
|
Here is the call graph for this function:
|
|
Definition at line 16 of file init.c. References f(), g(), i, j, printf(), and y. 00017 {
00018 int i, j;
00019
00020 for (i = 0; y[i]; i++) {
00021 for (j = 0; y[i][j]; j++)
00022 printf(" %d", y[i][j]);
00023 printf("\n");
00024 }
00025 f();
00026 g(wordlist);
00027 return 0;
00028 }
|
Here is the call graph for this function:
|
|
Initial value: {
1, 2, 3, "if",
{ { 4, 5 }, { 'f', 'o', 'r' } },
6, 7, 8, {"else"},
{ { 9, 10, 11,}, 'w', 'h', 'i', 'l', 'e', },
{ 0 },
} *wordlist = words
|
|
|
|
|
|
|
1.3.9.1