Entry Yang:1996:MMB from complngs.bib
Last update: Thu Jun 20 02:00:37 MDT 2019
Top |
Symbols |
Numbers |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Yang:1996:MMB,
author = "Wuu Yang",
title = "{Mealy} machines are a better model of lexical
analyzers",
journal = j-COMP-LANGS,
volume = "22",
number = "1",
pages = "27--38",
month = apr,
year = "1996",
CODEN = "COLADA",
ISSN = "0096-0551 (print), 1873-6742 (electronic)",
ISSN-L = "0096-0551",
bibdate = "Sat Mar 28 20:04:05 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/complngs.bib",
acknowledgement = ack-nhfb,
affiliation = "Natl Chiao-Tung Univ",
affiliationaddress = "Taiwan",
classcodes = "C4220 (Automata theory); C4240 (Programming and
algorithm theory)",
classification = "721.1; 723.2; 723.5; 921.6; C4220 (Automata theory);
C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Comput. and Inf. Sci., Nat. Chiao Tung Univ.,
Hsinchu, Taiwan",
journal-URL = "http://www.sciencedirect.com/science/journal/00960551",
journalabr = "Comput Lang",
keywords = "Automata theory; Computer programming languages;
Context free syntax; Data reduction; data-parallel
lexical analysis; Encoding (symbols); finite; finite
automata; finite lookahead automata; Finite lookahead
automata; input character; input character
partitioning; Lexical analysis; lexical analyzers;
longest-match rule; look-ahead problem; lookahead
automata; machines; Mathematical models; Mealy
machines; Moore; Moore machines; output tokens;
parallel algorithms; Parallel algorithms; parallel
algorithms; partitioning; Problem solving; program
compilers; programming theory; sequential analysis;
state transitions; suffix automata; Suffix automata;
suffix automata",
pubcountry = "UK",
treatment = "T Theoretical or Mathematical",
}
Related entries
- analysis,
1(1)17,
1(2)161,
1(3)197,
1(3)233,
2(3)93,
3(3)163,
3(4)227,
4(1)49,
4(3)131,
5(2)52,
5(2)115,
5(3)141,
7(2)53,
7(3)103,
9(2)89,
9(3)161,
10(1)37,
10(1)63,
10(2)127,
11(3)123,
12(1)9,
13(1)23,
13(2)51,
13(2)75,
14(1)25,
14(2)83,
14(2)99,
14(2)125,
14(4)225,
14(4)263,
16(1)39,
17(2)147,
18(4)251,
19(2)65,
19(2)79,
19(2)105,
19(2)119,
19(4)213,
20(1)1,
20(2)127,
20(3)177,
20(3)193,
21(1)49,
22(1)1,
22(1)15,
22(4)215,
23(1)25,
28(3)273,
29(1)15,
30(3)207,
31(3)183,
35(1)63,
36(4)352,
37(4)168,
38(1)44,
41(z)42,
47(z)104,
47(z)211,
49(z)36,
50(z)31,
50(z)127,
54(z)71,
54(z)406,
54(z)427,
54(z)544
- analyzer,
10(2)127,
21(1)49
- automata,
1(2)121,
3(1)53,
4(2)83,
4(3)131,
4(3)171,
9(3)149,
10(2)127,
12(2)123,
13(1)1,
13(2)65,
13(3)125,
13(3)149,
14(1)25,
14(1)53,
14(4)225,
15(1)27,
15(4)193,
15(4)205,
16(2)167,
18(3)169,
21(1)1,
46(z)91
- better,
1(4)277
- C4240,
22(4)215,
22(4)225,
23(2)61,
23(2)161,
23(2)179
- character,
5(2)52,
6(3)155,
7(1)25,
12(2)123,
14(1)53,
17(3)169,
20(1)43
- context,
2(1)9,
11(2)85,
16(1)97,
16(2)167,
17(1)61,
19(4)247,
20(1)43,
20(2)89,
20(2)101,
20(4)239,
21(1)1,
48(z)39,
54(z)20
- data-parallel,
22(2)165
- encoding,
1(3)255
- finite,
1(3)197,
1(3)233,
3(1)53,
10(2)127,
12(2)123,
13(3)125,
14(1)53,
23(2)61
- free,
1(1)29,
2(1)9,
4(3)187,
11(2)85,
13(3)125,
16(2)167,
17(1)61,
18(4)251,
20(1)43,
20(2)89,
20(2)101,
20(4)239,
21(1)1,
21(3)129
- input,
20(1)43,
21(3)165,
22(4)225
- lexical,
10(2)127,
15(1)55,
28(3)273
- longest-match,
28(3)273
- lookahead,
12(2)95,
16(2)167
- machine,
1(1)17,
1(2)121,
2(1)27,
2(3)75,
3(1)1,
3(1)53,
3(2)95,
4(2)83,
5(2)103,
6(1)47,
6(2)67,
6(3)131,
9(3)149,
10(2)127,
10(3)189,
15(3)127,
16(1)81,
16(2)129,
17(1)1,
18(1)17,
18(2)137,
19(3)205,
19(4)235,
20(1)25,
20(3)135,
20(4)253,
20(4)267,
22(2)165,
23(2)87,
23(2)121,
54(z)297,
54(z)544
- match, longest-,
28(3)273
- mathematical,
3(1)31,
3(1)37,
3(2)65,
3(2)115,
3(3)145,
4(2)99,
11(1)29,
13(1)31,
13(3)143,
16(1)5,
17(3)169,
20(2)69,
20(2)89,
20(2)101,
20(4)267,
22(1)1,
22(1)15,
22(2)165
- output,
3(1)1,
21(3)165
- parallel, data-,
22(2)165
- partitioning,
11(3)161,
19(2)105,
20(3)135,
24(4)197,
25(3)145,
53(z)143
- problem,
1(1)61,
1(1)83,
1(2)161,
1(3)197,
1(3)255,
1(4)321,
2(1)1,
2(3)75,
3(1)53,
3(3)145,
3(3)193,
4(1)17,
4(3)187,
5(3)155,
7(3)125,
8(2)69,
8(3)95,
11(3)161,
12(1)9,
14(1)11,
14(3)137,
14(3)153,
14(4)255,
16(1)97,
16(3)235,
19(3)157,
19(3)169,
19(3)205,
20(3)177,
21(2)113,
22(4)259,
23(1)25,
23(1)43,
23(2)61,
24(1)1,
26(2)165
- reduction,
11(1)1,
19(3)205,
23(2)61,
30(3)99,
31(2)49,
39(3)95
- rule,
3(2)127,
5(1)37,
5(2)77,
7(2)61,
7(2)89,
10(2)147,
11(2)85,
12(2)123,
12(3)173,
14(2)63,
14(2)125,
15(1)27,
15(3)127,
16(3)259,
18(4)251,
20(4)213,
20(4)253,
21(3)165,
22(2)95,
28(3)273,
36(3)268,
47(z)19,
51(z)102
- sequential,
1(2)151,
8(3)95,
11(3)143,
11(3)155,
12(1)27,
13(1)31,
15(3)141,
18(1)17,
19(2)135,
19(3)185,
19(3)205,
19(4)247,
20(3)135,
22(2)95,
22(2)181,
22(4)193
- solving,
14(3)137,
14(3)153,
23(1)25,
23(1)43,
24(1)1,
26(2)165
- state,
3(1)53,
5(2)52,
10(2)127,
10(2)147,
12(2)123,
14(1)53,
20(1)53,
22(1)1,
27(4)163,
38(2)181,
45(z)132,
54(z)544
- symbol,
1(2)105,
2(4)171,
10(2)127,
12(2)123,
16(2)167,
17(2)147,
17(3)169,
19(2)65,
19(2)79,
19(2)105,
19(3)169,
20(2)69,
21(1)1,
21(1)17,
21(1)49,
21(2)101,
22(1)39,
22(2)95,
23(1)1
- syntax,
1(1)83,
1(3)233,
2(1)9,
3(1)13,
3(4)227,
4(3)131,
4(3)171,
5(1)37,
6(1)1,
6(2)79,
6(2)95,
10(2)127,
10(3)225,
11(2)85,
11(3)173,
13(2)65,
14(2)83,
14(2)93,
14(3)153,
14(3)205,
16(1)97,
17(3)169,
17(3)199,
18(3)169,
18(4)241,
18(4)251,
19(4)235,
20(2)101,
20(4)213,
20(4)239,
22(4)215,
23(1)1,
24(2)73
- tokens,
10(2)127
- transition,
4(2)83,
9(3)161,
12(2)123,
14(1)53,
20(1)1,
54(z)544
- Yang, Wuu,
25(3)145,
28(2)203,
28(3)273,
43(z)96