Entry Barnard:1988:SPL 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:1988:SPL,
author = "David T. Barnard and James R. Cordy",
title = "{SL} parses the {LR} languages",
journal = j-COMP-LANGS,
volume = "13",
number = "2",
pages = "65--74",
month = "????",
year = "1988",
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 = "Kingston, Ont, Can",
classcodes = "C4210 (Formal logic); C6150C (Compilers, interpreters
and other processors)",
classification = "721; 723",
corpsource = "Dept. of Comput. and Inf. Sci., Queen's Univ.,
Kingston, Ont., Canada",
journal-URL = "http://www.sciencedirect.com/science/journal/00960551",
journalabr = "Comput Lang",
keywords = "Automata Theory--Grammars; BNF grammars; Computer
Operating Systems; Computer Programming Languages;
dataless programming language; formal languages;
grammars; LL(1) languages; LR(k) languages; Parsers
with Conflicts; parsing; program compilers; Recursive
Descent Parsers; recursive descent parsers; S/SL; SL;
SL Parsers; Syntax Language; Syntax Language (SL);
Syntax/Semantic Language; Syntax/Semantic Language
(S/SL)",
treatment = "P Practical; T Theoretical or Mathematical",
}
Related entries
- 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(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,
22(1)27,
46(z)91
- Barnard, David T.,
6(1)19,
14(2)93,
19(4)247
- BNF,
3(3)145,
5(1)37,
10(3)225,
12(1)9,
12(3)173,
14(2)93,
17(3)199
- conflict,
14(1)25,
19(2)135
- Cordy, James R.,
14(2)93,
16(1)97,
19(2)63
- dataless,
14(2)93
- descent,
14(2)93,
15(4)193,
18(1)1
- Grammars, Theory-,
13(3)149,
14(1)25,
14(4)225
- LL1,
10(2)127,
14(2)93,
15(4)193
- LR,
6(2)95,
13(3)125,
15(4)205,
16(2)167,
19(4)247,
20(3)151,
24(2)73,
36(1)16,
50(z)108
- 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,
10(3)225,
11(2)85,
11(2)105,
12(1)9,
12(1)21,
12(1)47,
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
- parse,
3(2)127,
4(3)131,
19(3)157,
20(3)151,
22(4)225
- parser,
1(2)105,
1(2)121,
1(3)233,
2(4)179,
10(2)127,
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(2)89,
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(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
- recursive,
3(1)31,
5(3)155,
6(3)115,
8(1)15,
11(2)55,
14(1)11,
14(2)93,
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,
14(2)93
- 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,
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
- Syntax/Semantic,
14(2)93
- Theory--Grammars,
13(3)149,
14(1)25,
14(4)225