Entry Sarbo:1994:GTO 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{Sarbo:1994:GTO,
  author =       "Janos J. Sarbo",
  title =        "Grammar transformations for optimizing backtrack
                 parsers",
  journal =      j-COMP-LANGS,
  volume =       "20",
  number =       "2",
  pages =        "89--100",
  month =        may,
  year =         "1994",
  CODEN =        "COLADA",
  ISSN =         "0096-0551 (print), 1873-6742 (electronic)",
  ISSN-L =       "0096-0551",
  bibdate =      "Tue Mar 25 14:04:06 MST 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/complngs.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Nijmegen",
  affiliationaddress = "Nijmegen, Neth",
  classcodes =   "C4210 (Formal logic); C4240 (Programming and algorithm
                 theory); C6150C (Compilers, interpreters and other
                 processors)",
  classification = "721.1; 723.1; 723.1.1; 921.1; 921.3",
  corpsource =   "Fac. of Math. and Inf., Nijmegen Univ., Netherlands",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00960551",
  journalabr =   "Comput Lang",
  keywords =     "Ambiguity; backtrack parsers; Backtracking;
                 computational complexity; Computational complexity;
                 Context free grammars; Data handling; Decision tables;
                 factorization; grammar property; Grammar
                 transformation; grammar transformations; grammars;
                 left-; Linear programming; LR-table construction;
                 Mathematical transformations; Parsing; Polynomials;
                 Program compilers; program compilers; relative
                 unambiguity; search space; substitution; time
                 complexity; top-down backtrack parsers",
  treatment =    "T Theoretical or Mathematical",
}
Related entries
- backtracking,
8(2)61,
9(3)183,
10(2)75,
12(2)95,
14(3)153,
19(3)185,
22(2)115
 
- complexity,
3(3)163,
7(2)61,
7(3)103,
7(3)147,
9(3)133,
9(3)203,
10(3)211,
13(1)23,
13(3)109,
14(1)11,
14(2)125,
15(1)27,
15(2)83,
17(4)251,
17(4)269,
19(2)135,
19(3)169,
20(1)43,
20(1)53,
20(2)101,
20(2)127,
20(3)177,
20(4)239,
20(4)267,
21(1)17,
21(1)49,
21(2)101,
21(2)113,
24(1)33
 
- computational,
1(1)17,
2(1)27,
7(3)147,
10(1)43,
10(3)211,
11(1)39,
13(1)13,
13(3)109,
14(1)11,
14(1)53,
14(2)125,
14(4)225,
15(1)1,
15(1)27,
15(2)83,
15(4)251,
16(2)113,
16(2)147,
17(4)251,
17(4)269,
18(4)251,
19(2)65,
19(2)79,
19(2)119,
19(2)135,
19(3)157,
19(3)169,
20(1)1,
20(1)43,
20(1)53,
20(2)101,
20(2)127,
20(3)151,
20(3)177,
20(4)213,
20(4)239,
20(4)253,
20(4)267,
21(1)17,
21(1)49,
21(2)67,
21(2)101,
21(2)113,
22(2)51,
22(2)115,
22(4)225,
23(1)1,
23(1)25,
23(2)61,
23(2)87,
23(2)121,
24(1)33,
33(1)1,
35(4)406,
39(4)163,
54(z)95
 
- construction,
7(2)53,
16(2)167,
20(3)151
 
- context,
2(1)9,
11(2)85,
16(1)97,
16(2)167,
17(1)61,
19(4)247,
20(1)43,
20(2)101,
20(4)239,
21(1)1,
22(1)27,
48(z)39,
54(z)20
 
- decision,
10(1)23,
14(1)25
 
- down, top-,
10(1)23,
21(1)39
 
- factorization,
3(4)241
 
- 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)101,
20(4)239,
21(1)1,
21(3)129,
22(1)27
 
- handling,
1(1)29,
1(1)83,
2(3)75,
5(2)77,
6(3)155,
7(1)1,
7(2)89,
8(2)77,
10(1)43,
11(3)123,
13(1)13,
13(1)23,
13(2)75,
13(3)149,
15(3)163,
15(3)177,
15(4)251,
16(1)65,
17(2)83,
19(4)247,
20(1)53,
20(2)69,
20(2)101,
20(2)127,
20(4)239,
22(1)39,
22(2)51,
22(2)95,
22(4)193,
23(1)43,
24(2)73,
24(4)245,
34(4)170,
37(1)43
 
- linear,
12(1)1,
13(3)109,
15(2)83,
20(1)43,
20(4)239,
21(1)49,
21(2)113
 
- 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)101,
20(4)267,
22(1)1,
22(1)15,
22(1)27,
22(2)165
 
- optimizing,
5(3)141,
6(1)47,
8(2)69,
14(3)193,
18(4)217,
19(2)91,
20(1)43,
25(2)89,
35(3)266
 
- parser,
1(2)105,
1(2)121,
1(3)233,
2(4)179,
10(2)127,
13(2)65,
13(3)125,
14(1)25,
14(2)93,
15(4)205,
16(2)167,
18(1)1,
18(4)241,
19(4)247,
20(3)151,
22(4)225,
35(2)196,
50(z)108
 
- parsing,
1(2)105,
1(3)233,
3(2)127,
6(2)67,
6(2)95,
9(3)161,
10(2)127,
10(3)225,
11(1)39,
11(2)65,
13(1)1,
13(2)65,
13(3)125,
14(1)25,
14(2)99,
15(4)193,
16(2)167,
17(1)61,
18(1)1,
18(4)241,
18(4)251,
19(4)247,
20(1)43,
20(2)101,
20(3)151,
20(4)213,
20(4)239,
22(4)225,
36(1)16,
50(z)108
 
- polynomial,
15(1)27
 
- property,
3(1)37,
3(4)265,
16(1)19,
16(3)259,
17(3)157,
22(1)1,
23(2)161,
30(3)231,
43(z)116,
47(z)77
 
- Sarbo, Janos J.,
14(3)205,
18(2)137
 
- search,
3(1)31,
5(2)52,
19(3)205,
21(2)113,
23(2)61,
23(2)161,
46(z)182,
47(z)153,
47(z)211
 
- space,
3(3)163,
13(1)1,
19(2)91,
20(3)135,
20(4)213,
22(2)79,
22(4)205,
23(2)61,
37(4)168,
54(z)358
 
- substitution,
1(4)287,
23(2)161
 
- table,
1(2)105,
1(3)233,
2(4)179,
10(1)23,
10(2)127,
15(3)127,
17(2)147,
22(4)225
 
- time,
1(1)17,
2(1)27,
3(3)163,
5(3)155,
7(2)53,
11(1)39,
12(1)39,
13(1)23,
14(1)1,
14(2)125,
15(1)27,
15(3)153,
15(3)177,
16(1)19,
16(1)39,
16(1)65,
16(2)113,
17(3)185,
18(2)77,
18(4)241,
19(1)41,
19(2)105,
20(1)1,
20(1)25,
20(1)43,
20(3)151,
20(3)193,
20(4)239,
21(2)81,
21(3)129,
22(1)39,
23(2)87,
25(1)39,
40(3)155
 
- top-down,
10(1)23,
21(1)39
 
- transformation,
3(4)241,
6(1)35,
8(2)69,
14(3)205,
16(1)97,
17(1)19,
17(3)157,
17(4)241,
19(2)105,
19(3)157,
20(3)135,
22(2)181,
32(2)125,
36(3)223,
37(4)193,
40(2)73,
43(z)116,
44(z)48,
46(z)106