Entry Leermakers:1992:RAP from tcs1990.bib
Last update: Wed Sep 26 02:11:46 MDT 2018
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{Leermakers:1992:RAP,
author = "Ren{\'e} Leermakers",
title = "Recursive ascent parsing: from {Earley} to {Marcus}",
journal = j-THEOR-COMP-SCI,
volume = "104",
number = "2",
pages = "299--312",
day = "12",
month = oct,
year = "1992",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:16:45 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1992&volume=104&issue=2;
http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1992&volume=104&issue=2&aid=1194",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C6150C (Compilers,
interpreters and other processors); C6180N (Natural
language processing)",
corpsource = "Inst. for Perception Res., Eindhoven, Netherlands",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "C; computational linguistics; context-free grammars;
Earley algorithm; function calls; function
memorization; language compilation; look-ahead parsers;
low-level imperative languages; LR parsing; natural
language; natural languages; parsing tables; program
compilers; recursive ascent parsing; recursive
functions; stacks",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- ahead, look-,
93(1)43
- ascent,
104(2)313
- C6150C,
71(2)177,
71(2)193,
71(2)209,
71(2)227,
71(2)z,
73(2)231,
80(1)105,
80(2)303,
90(2)271,
122(1)165,
128(1)99
- call,
124(1)93,
129(1)79
- compilation,
71(2)177,
71(2)209,
71(2)z,
87(1)43,
90(1)17,
119(1)z,
131(1)197
- compiler,
71(2)177,
71(2)193,
71(2)209,
71(2)227,
71(2)241,
71(2)z,
73(2)231,
80(1)105,
80(2)303,
90(1)17,
90(2)271,
122(1)165,
122(1)201,
128(1)99
- Earley,
80(1)53
- imperative,
75(1)3,
75(1)15,
76(2)179,
93(1)91,
103(2)235,
104(1)53,
106(1)119,
131(1)95
- interpreter,
71(2)177,
71(2)193,
71(2)209,
71(2)227,
71(2)z,
73(2)231,
78(1)189,
80(1)105,
80(2)303,
89(1)137,
90(2)271,
122(1)165,
128(1)99
- level, low-,
72(2)225
- linguistics,
70(1)35,
70(1)85,
70(1)151,
77(1)5,
77(1)73,
77(1)195,
77(1)z,
80(2)319,
93(1)43,
104(2)235,
134(2)311,
134(2)365,
134(2)529,
134(2)537,
134(2)545,
135(2)171,
135(2)267,
135(2)345,
136(1)21,
136(1)57,
136(1)79,
136(1)109,
136(1)125,
136(1)163,
136(1)183,
136(1)243,
136(1)277,
136(2)333,
136(2)361,
136(2)471,
136(2)487,
141(1)329
- look-ahead,
93(1)43
- low-level,
72(2)225
- LR,
104(2)313
- natural,
70(1)35,
70(1)65,
70(1)85,
70(2)233,
77(3)237,
81(2)201,
85(2)333,
87(1)25,
87(1)43,
87(1)189,
88(1)83,
88(2)191,
89(1)161,
91(1)23,
95(1)115,
97(2)183,
98(2)289,
102(1)1,
104(2)235,
110(2)249,
111(1)145,
115(1)3,
115(1)151,
116(1)33,
123(1)31,
123(1)131,
127(2)351,
133(2)205,
134(2)537,
136(1)57
- other,
71(2)177,
71(2)193,
71(2)209,
71(2)227,
71(2)z,
73(2)231,
74(1)95,
74(2)163,
74(2)183,
74(3)253,
77(1)73,
77(1)195,
78(1)3,
80(1)105,
80(2)303,
81(2)237,
84(1)77,
84(1)127,
86(2)205,
90(2)271,
92(2)249,
100(1)105,
108(2)291,
112(2)383,
121(1)351,
122(1)165,
123(2)291,
125(2)329,
128(1)99,
129(2)279,
129(2)407,
130(1)17,
130(1)203,
133(1)15
- parser,
104(2)313
- parsing,
71(2)177,
82(1)165,
85(1)53,
90(1)209,
112(1)53,
120(2)303
- processing,
73(1)1,
73(1)61,
74(2)121,
74(2)183,
76(1)93,
76(1)115,
81(2)237,
89(1)179,
90(1)185,
91(2)285,
93(1)75,
95(1)1,
95(1)169,
96(1)3,
96(1)217,
102(2)253,
108(2)371,
116(1)33,
116(1)59,
116(1)95,
116(1)117,
116(1)151,
116(1)195,
119(2)355,
120(2)197,
128(1)127,
128(1)159,
128(1)211,
129(2)293,
129(2)397,
130(1)101,
133(2)267,
133(2)421,
134(2)287,
134(2)365
- processor,
71(2)177,
71(2)193,
71(2)209,
71(2)227,
71(2)z,
73(1)61,
73(2)231,
80(1)105,
80(2)303,
81(2)237,
81(2)311,
90(2)271,
104(2)285,
106(2)243,
116(2)421,
118(1)3,
120(2)215,
122(1)165,
123(2)427,
125(1)3,
128(1)99,
130(1)17,
130(1)49,
134(2)493
- stack,
88(1)117,
113(1)75,
117(1)217,
117(1)303,
119(1)63,
119(2)233,
124(2)273
- table,
82(1)51,
92(1)165,
108(2)311