Entry Noonan:1985:AGA 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{Noonan:1985:AGA,
author = "Robert E. Noonan",
title = "An algorithm for generating abstract syntax trees",
journal = j-COMP-LANGS,
volume = "10",
number = "3-4",
pages = "225--236",
month = "????",
year = "1985",
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,
affiliationaddress = "Coll of William \& Mary, Dep of Computer
Science, Williamsburg, VA, USA",
classcodes = "C4210 (Formal logic); C6120 (File organisation);
C6140D (High level languages)",
classification = "722; 723",
corpsource = "Dept. of Comput. Sci., Coll. of William and Mary,
Williamsburg, VA, USA",
journal-URL = "http://www.sciencedirect.com/science/journal/00960551",
journalabr = "Comput Lang",
keywords = "abstract syntax; abstract syntax trees; Algorithms;
BNF grammar; computer operating systems --- Program
Compilers; computer programming; data structures;
grammars; Modula; parsing",
treatment = "P Practical",
}
Related entries
- abstract,
1(2)121,
2(3)61,
3(1)13,
5(2)77,
6(2)67,
8(3)95,
9(1)1,
9(3)149,
10(1)1,
10(3)189,
12(1)21,
12(2)69,
12(3)145,
13(3)109,
14(3)165,
16(2)147,
17(1)75,
17(3)157,
18(2)137,
18(4)241,
18(4)273,
19(1)19,
19(2)65,
19(2)79,
19(3)205,
19(4)235,
20(1)25,
20(2)117,
22(1)1,
22(4)215,
23(2)87,
23(2)121,
35(2)100,
37(1)24,
38(2)123,
42(z)22,
43(z)41,
47(z)1,
47(z)77
- BNF,
3(3)145,
5(1)37,
12(1)9,
12(3)173,
13(2)65,
14(2)93,
17(3)199
- generating,
14(2)93,
17(3)199,
21(2)113
- Modula,
6(3)131,
15(3)141,
17(1)39,
18(2)105
- operating,
2(4)117,
3(2)75,
3(3)163,
3(4)227,
3(4)241,
4(1)17,
4(2)71,
5(3)131,
5(3)141,
6(1)47,
6(3)139,
8(2)51,
8(2)61,
9(2)97,
9(3)149,
10(1)37,
10(2)127,
10(2)147,
10(3)165,
11(2)85,
11(2)105,
12(1)9,
12(1)21,
12(1)47,
13(2)65,
13(2)75,
13(2)95,
14(1)1,
14(1)11,
14(1)25,
14(3)193,
14(3)205,
15(1)27,
15(2)83,
15(3)127,
15(3)141,
15(3)163,
15(3)177,
15(4)193,
15(4)205,
16(1)81,
16(3)209,
17(4)213,
18(2)137,
20(2)69,
20(2)117,
21(1)17,
22(2)51
- parsing,
1(2)105,
1(3)233,
3(2)127,
6(2)67,
6(2)95,
9(3)161,
10(2)127,
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)89,
20(2)101,
20(3)151,
20(4)213,
20(4)239,
22(4)225,
36(1)16,
50(z)108
- 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,
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(1)27,
22(4)215,
23(1)1,
24(2)73
- tree,
1(3)233,
3(1)31,
3(2)65,
3(2)135,
4(3)131,
5(1)29,
11(2)65,
15(3)127,
19(3)157,
20(3)151,
20(4)267,
21(1)49,
21(2)113,
22(4)225,
37(2)63,
39(4)163,
47(z)2