Entry Barnard:1989:AGS 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{Barnard:1989:AGS,
author = "David T. Barnard and James R. Cordy",
title = "Automatically generating {SL} parsers from {LL}(1)
grammars",
journal = j-COMP-LANGS,
volume = "14",
number = "2",
pages = "93--98",
month = "????",
year = "1989",
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 = "Queen's Univ",
affiliationaddress = "Kingston, Ont, Can",
classcodes = "C4210 (Formal logic)",
classification = "723",
corpsource = "Dept. of Comput. and Info Sci., Queen's Univ.,
Kingston, Ont., Canada",
journal-URL = "http://www.sciencedirect.com/science/journal/00960551",
journalabr = "Comput Lang",
keywords = "automatic generation of parsers; BNF Grammars; BNF
grammars; Computer Programming Languages; Computer
Programming--Algorithms; dataless programming language;
grammars; LL(1) grammars; recursive descent parsers; SL
parsers; Syntax Language component; Syntax/Semantic
Language; Syntex Language Parsers",
treatment = "P Practical; T Theoretical or Mathematical",
}
Related entries
- Algorithms, Programming-,
14(2)99,
14(2)109,
14(2)125,
14(3)181,
14(4)239,
14(4)255,
14(4)263,
15(2)83,
15(2)109,
16(3)235
- automatic,
1(1)83,
1(2)161,
1(3)197,
1(4)321,
2(4)179,
3(3)163,
7(3)161,
11(3)173,
13(1)1,
14(3)205,
15(3)127,
16(1)39,
16(2)129,
17(1)67,
18(4)251,
19(3)169,
20(3)135,
20(4)239,
21(2)101,
21(2)113,
24(1)1,
27(1)115,
34(4)153,
36(2)203,
37(1)43,
43(z)96,
47(z)44,
53(z)59,
54(z)337,
54(z)512
- automatically,
1(4)321
- Barnard, David T.,
6(1)19,
13(2)65,
19(4)247
- BNF,
3(3)145,
5(1)37,
10(3)225,
12(1)9,
12(3)173,
13(2)65,
17(3)199
- component,
1(2)121,
7(2)89,
13(1)13,
21(1)39,
22(2)115,
22(2)181,
32(1)56,
39(3)67,
45(z)16
- Cordy, James R.,
13(2)65,
16(1)97,
19(2)63
- dataless,
13(2)65
- descent,
13(2)65,
15(4)193,
18(1)1
- generating,
10(3)225,
17(3)199,
21(2)113
- generation,
3(4)241,
5(2)115,
6(3)115,
9(3)149,
9(3)193,
10(1)63,
10(2)127,
10(2)147,
12(1)47,
13(1)1,
13(3)125,
14(3)193,
14(3)205,
15(1)27,
15(2)65,
15(3)127,
15(4)205,
16(1)39,
16(1)81,
17(1)1,
17(2)101,
17(4)251,
18(1)31,
18(2)137,
18(4)251,
19(3)169,
21(2)67,
21(2)101,
21(2)113,
24(1)33,
34(4)184,
35(4)422,
36(2)203,
45(z)204,
49(z)152,
52(z)43,
53(z)121
- LL1,
10(2)127,
13(2)65,
15(4)193
- 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,
15(4)205,
16(2)167,
18(1)1,
18(4)241,
19(4)247,
20(2)89,
20(3)151,
22(4)225,
35(2)196,
50(z)108
- Programming--Algorithms,
14(2)99,
14(2)109,
14(2)125,
14(3)181,
14(4)239,
14(4)255,
14(4)263,
15(2)83,
15(2)109,
16(3)235
- recursive,
3(1)31,
5(3)155,
6(3)115,
8(1)15,
11(2)55,
13(2)65,
14(1)11,
14(4)225,
15(1)55,
15(2)65,
15(4)193,
18(1)1,
19(1)19,
19(2)91,
24(1)1,
35(3)266,
53(z)143
- SL,
13(2)65
- 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(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(1)27,
22(4)215,
23(1)1,
24(2)73
- Syntax/Semantic,
13(2)65