Entry Seite:1987:YEL from tcs1985.bib
Last update: Thu Sep 27 02:46:57 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{Seite:1987:YEL,
author = "B. Seite",
title = "A {Yacc} extension for {LRR} grammar parsing",
journal = j-THEOR-COMP-SCI,
volume = "52",
number = "1--2",
pages = "91--143",
month = "????",
year = "1987",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory)",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Cohen-Culik LRR; complementary tables; conflicting
actions; deterministic bottom-up parsing; finite
automata; finite-state automata generation; grammars;
linear-time parsing; lookahead; LR automata; LR0
collection; LRR grammar parsing; stack; unbounded
examination; Yacc extension",
pubcountry = "Netherlands A06",
treatment = "T Theoretical or Mathematical",
}
Related entries
- action,
37(3)245,
53(1)151,
53(1)z,
58(1)183,
59(1)25,
63(3)275,
65(2)249
- bottom-up,
37(2)123
- conflicting,
38(1)1
- deterministic,
35(2)215,
36(1)89,
37(1)1,
37(2)123,
38(1)133,
38(2)323,
40(1)31,
40(1)57,
41(2)223,
41(2)305,
41(2)325,
42(3)251,
43(2)123,
43(2)337,
44(1)111,
46(2)219,
47(1)39,
47(2)149,
48(1)109,
48(1)117,
49(2)267,
52(1)77,
52(3)269,
54(1)65,
61(1)25,
61(2)149,
64(1)39,
66(1)65,
66(3)273,
67(1)65
- extension,
35(2)329,
38(2)307,
39(2)337,
52(3)205,
53(1)125
- finite-state,
58(1)263,
67(1)5,
68(1)19
- generation,
37(2)151,
43(2)169,
44(2)209,
56(1)59,
57(1)153,
60(3)255,
65(2)143,
66(3)289,
68(2)175
- grammar,
35(1)1,
37(1)31,
37(2)123,
37(2)217,
37(3)357,
38(2)323,
39(1)3,
39(1)z,
39(2)281,
40(2)149,
40(2)163,
40(2)315,
41(1)1,
41(1)33,
42(1)1,
44(2)229,
44(3)275,
44(3)307,
45(1)87,
47(1)27,
47(1)107,
47(2)219,
47(2)225,
47(3)315,
48(2)201,
49(1)23,
51(1)81,
52(1)1,
53(1)25,
53(2)295,
55(1)1,
55(1)47,
55(2)141,
59(3)309,
62(3)267,
66(1)65,
67(1)75
- linear-time,
47(1)15,
59(1)115,
66(2)181
- LR0,
66(1)65
- parsing,
47(3)315,
53(2)295,
59(3)297
- stack,
39(2)267,
44(1)111,
58(1)69,
63(3)303
- state, finite-,
58(1)263,
67(1)5,
68(1)19
- table,
39(2)309,
40(2)149
- time, linear-,
47(1)15,
59(1)115,
66(2)181
- unbounded,
38(1)99,
40(2)211,
59(3)211,
63(2)185,
68(3)277
- up, bottom-,
37(2)123