File: sentinel.c

package info (click to toggle)
re2c 4.4-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 51,512 kB
  • sloc: cpp: 34,160; ml: 8,494; sh: 5,311; makefile: 1,014; haskell: 611; python: 431; ansic: 234; javascript: 113
file content (123 lines) | stat: -rw-r--r-- 2,153 bytes parent folder | download | duplicates (2)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
/* Generated by re2c */
// re2c $INPUT -o $OUTPUT --recursive-functions -i
#include <assert.h>


int yy0(const char* YYCURSOR, int count);
int yy1(const char* YYCURSOR, int count);
int yy2(const char* YYCURSOR, int count);
int yy3(const char* YYCURSOR, int count);
int yy4(const char* YYCURSOR, int count);
int yy5(const char* YYCURSOR, int count);
int yy6(const char* YYCURSOR, int count);
int lex(const char* YYCURSOR, int count);

int yy0(const char* YYCURSOR, int count) {
	char yych = *YYCURSOR++;
	switch (yych) {
		case 0x00: return yy1(YYCURSOR, count);
		case ' ': return yy3(YYCURSOR, count);
		case 'a':
		case 'b':
		case 'c':
		case 'd':
		case 'e':
		case 'f':
		case 'g':
		case 'h':
		case 'i':
		case 'j':
		case 'k':
		case 'l':
		case 'm':
		case 'n':
		case 'o':
		case 'p':
		case 'q':
		case 'r':
		case 's':
		case 't':
		case 'u':
		case 'v':
		case 'w':
		case 'x':
		case 'y':
		case 'z': return yy5(YYCURSOR, count);
		default: return yy2(YYCURSOR, count);
	}
}

int yy1(const char* YYCURSOR, int count) {
	return count;
}

int yy2(const char* YYCURSOR, int count) {
	return -1;
}

int yy3(const char* YYCURSOR, int count) {
	char yych = *YYCURSOR;
	switch (yych) {
		case ' ':
			++YYCURSOR;
			return yy3(YYCURSOR, count);
		default: return yy4(YYCURSOR, count);
	}
}

int yy4(const char* YYCURSOR, int count) {
	return lex(YYCURSOR, count);
}

int yy5(const char* YYCURSOR, int count) {
	char yych = *YYCURSOR;
	switch (yych) {
		case 'a':
		case 'b':
		case 'c':
		case 'd':
		case 'e':
		case 'f':
		case 'g':
		case 'h':
		case 'i':
		case 'j':
		case 'k':
		case 'l':
		case 'm':
		case 'n':
		case 'o':
		case 'p':
		case 'q':
		case 'r':
		case 's':
		case 't':
		case 'u':
		case 'v':
		case 'w':
		case 'x':
		case 'y':
		case 'z':
			++YYCURSOR;
			return yy5(YYCURSOR, count);
		default: return yy6(YYCURSOR, count);
	}
}

int yy6(const char* YYCURSOR, int count) {
	return lex(YYCURSOR, ++count);
}

int lex(const char* YYCURSOR, int count) {
	return yy0(YYCURSOR, count);
}



int main()
{
    assert(lex("", 0) == 0);
    assert(lex("one two three", 0) == 3);
    assert(lex("f0ur", 0) == -1);
    return 0;
}