Entry Edupuganty:1989:TLG from compj1980.bib
Last update: Sat Jan 6 02:03:49 MST 2018
Top |
Symbols |
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{Edupuganty:1989:TLG,
author = "B. Edupuganty and B. R. Bryant",
title = "Two-level Grammar as a Functional Programming
Language",
journal = j-COMP-J,
volume = "32",
number = "1",
pages = "36--44",
month = feb,
year = "1989",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/32.1.36",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:48:26 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/32/1.toc;
http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/",
URL = "http://comjnl.oxfordjournals.org/content/32/1/36.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/36.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/37.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/38.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/39.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/40.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/41.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/42.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/43.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/44.tif",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. and Info. Sci., Alabama Univ.,
Birmingham, AL, USA",
affiliationaddress = "Birmingham, AL, USA",
classcodes = "C4210 (Formal logic); C6140D (High level languages)",
classification = "721; 723; C4210 (Formal logic); C6140D (High level
languages)",
corpsource = "Dept. of Comput. and Info. Sci., Alabama Univ.,
Birmingham, AL, USA",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "Automata Theory--Grammars; Computer
Programming--Algorithms; context-; context-free
grammars; Context-free grammars; Data Abstraction; free
grammars; function evaluation rules; Function
evaluation rules, Computer Programming Languages;
functional programming; functional programming
language; Functional programming language; Functional
Programming Languages; high level; language; languages;
Procedural Abstraction; recursive functions; Recursive
functions; Turing machine; two-level grammar; Two-Level
Grammar; Two-level grammar",
thesaurus = "Context-free grammars; Functional programming; High
level languages",
treatment = "P Practical",
}
Related entries
- abstraction,
23(1)41,
23(4)380,
23(4)381,
24(2)118,
25(2)207,
27(1)47,
28(3)298,
29(4)348,
30(4)328,
31(2)165,
31(3)193,
31(3)229,
31(6)531,
32(4)297
- Algorithms;, Programming-,
31(6)553,
31(6)561,
31(6)570,
32(1)45,
32(1)68,
32(1)91
- automata,
24(2)156,
26(2)142,
27(3)233,
28(4)372,
28(5)449,
29(3)241,
30(4)328,
31(6)510,
32(1)16,
32(1)91
- C4210,
31(6)510,
31(6)525,
31(6)564,
32(1)91,
32(4)290,
32(5)399,
32(5)445
- C6140D,
32(1)90,
32(2)127,
32(2)152,
32(4)290,
32(4)297,
32(4)305,
32(4)312,
32(4)323,
32(4)341,
32(5)413
- context-free,
26(2)142,
29(3)241,
30(4)328,
32(1)91,
32(5)445
- evaluation,
23(2)142,
23(2)187-1,
24(3)288,
25(2)183,
25(2)188,
25(2)239,
25(4)493,
26(2)134,
27(1)87,
27(3)201,
28(2)128,
28(2)142,
28(3)223,
28(3)309,
28(3)319,
28(4)409,
28(4)426,
29(4)380,
29(4)380-1,
29(5)390,
29(5)396,
30(3)214,
30(3)228,
30(4)289,
30(4)362,
30(4)376,
30(5)437,
30(6)481,
30(6)519,
31(1)12,
31(3)220,
31(4)304,
31(5)409,
31(5)437,
31(6)565,
32(2)98,
32(2)142,
32(2)162,
32(5)437,
32(5)461
- formal,
27(2)121,
28(1)59,
28(2)112,
28(2)162,
28(5)474,
28(5)480,
29(6)481,
30(2)134,
30(2)183,
30(4)316,
30(4)328,
30(4)337,
30(6)507,
31(4)313,
31(4)325,
31(4)336,
31(6)510,
31(6)525,
31(6)564,
32(1)1,
32(1)90,
32(1)91,
32(4)290,
32(4)305,
32(4)351,
32(5)385,
32(5)399,
32(5)413,
32(5)422,
32(5)432,
32(5)445
- free,
23(4)298,
25(1)32,
26(1)25,
26(2)142,
27(4)328,
30(6)485,
31(3)209,
32(1)45,
32(1)91
- free, Context-,
32(1)91,
32(5)445
- free, context-,
26(2)142,
29(3)241,
30(4)328,
32(1)91,
32(5)445
- function,
23(2)165,
23(3)286,
24(1)42,
25(3)379,
25(3)397,
25(4)448,
28(1)54,
29(1)9,
29(1)38,
29(3)277,
29(4)289,
30(1)27,
31(1)17,
31(3)209,
31(3)229,
31(3)243,
31(6)510,
32(1)93,
32(2)98,
32(2)122,
32(4)305,
32(5)461
- grammar,
23(4)317,
24(2)156,
25(1)63,
25(3)316,
25(3)331,
26(1)15,
26(2)142,
26(2)164,
26(3)277,
27(1)57,
27(3)233,
28(1)17,
28(3)250,
29(2)151,
29(3)241,
29(4)307,
30(4)328,
31(4)330,
31(6)525,
32(1)91,
32(2)108,
32(5)445
- high,
23(2)124,
23(2)153,
24(1)56,
25(1)153,
25(2)176,
25(2)264,
25(3)289,
26(1)52,
26(1)72,
26(2)124,
26(2)175,
26(3)228,
26(3)277,
26(4)344,
26(4)360,
26(4)366,
27(1)37,
27(1)83,
27(2)97,
27(2)151,
28(1)34,
28(3)231,
28(3)250,
28(4)391,
29(2)118,
29(3)229,
29(3)253,
29(4)289,
29(4)340,
29(6)500,
29(6)506,
29(6)538,
30(2)128,
30(5)437,
30(6)487,
30(6)558,
31(2)99,
31(2)110,
31(3)220,
31(3)243,
32(1)90,
32(2)127,
32(2)152,
32(2)162,
32(4)290,
32(4)297,
32(4)305,
32(4)312,
32(4)323,
32(4)341,
32(5)413
- level,
23(2)124,
23(2)153,
24(1)25,
24(1)56,
24(1)62,
25(1)153,
25(2)176,
25(2)264,
25(3)289,
25(4)429,
26(1)52,
26(1)72,
26(2)124,
26(2)175,
26(2)188,
26(3)228,
26(3)235,
26(3)277,
26(4)344,
26(4)360,
26(4)366,
27(1)83,
27(2)97,
27(2)151,
27(4)334,
28(1)34,
28(3)250,
28(4)357,
29(2)118,
29(3)229,
29(3)253,
29(4)340,
29(6)500,
29(6)506,
29(6)538,
30(1)52,
30(2)128,
30(5)437,
30(6)487,
31(2)99,
31(2)110,
31(3)220,
31(3)229,
31(3)243,
31(4)344,
32(1)90,
32(2)127,
32(2)152,
32(2)162,
32(4)290,
32(4)297,
32(4)305,
32(4)312,
32(4)323,
32(4)341,
32(5)413
- Level, Two-,
28(3)250
- level, two-,
25(1)63,
26(2)134,
28(3)250,
29(2)176,
29(5)451
- logic,
23(2)165,
23(2)191,
25(1)140,
25(2)218,
25(2)287,
27(3)260,
28(2)112,
28(5)474,
28(5)487,
29(1)9,
29(1)12,
29(1)17,
29(3)241,
29(3)246,
29(6)481,
29(6)495,
29(6)545,
30(1)77,
30(2)134,
30(2)183,
30(3)258,
30(3)283,
30(5)386,
30(5)393,
31(2)133,
31(3)220,
31(4)336,
31(6)510,
31(6)525,
31(6)564,
32(1)29,
32(1)90,
32(1)91,
32(4)290,
32(5)399,
32(5)445,
32(5)453
- machine,
23(3)229,
25(1)153,
26(4)293,
27(3)254,
27(3)283,
28(2)148,
28(5)449,
29(5)396,
29(5)451,
30(2)110,
30(3)214,
30(5)386,
30(5)393,
30(5)420,
31(4)325,
31(5)386,
31(5)391,
31(5)398,
31(5)409,
31(5)420,
31(5)426,
31(5)431,
31(5)437,
31(5)457,
31(6)490,
32(2)127,
32(2)152,
32(2)175,
32(5)461
- procedural,
23(2)132,
27(1)47,
28(1)17,
30(5)437,
31(3)243
- Programming--Algorithms,
31(6)553,
31(6)561,
31(6)570,
32(1)45,
32(1)68,
32(1)91
- recursive,
23(4)332,
25(2)231,
26(1)15,
26(3)205,
27(2)171,
28(1)78,
29(2)161,
29(2)182,
29(6)531,
30(4)376,
31(3)229,
31(3)283,
31(4)358,
31(6)561,
31(6)565,
32(3)281
- rule,
23(3)207,
24(2)156,
25(1)105,
26(1)1,
27(4)328,
28(3)270,
28(4)366,
29(3)253,
29(4)322,
29(6)531,
30(2)168,
30(4)328,
31(2)125,
32(2)108,
32(6)541
- Turing,
31(4)325
- Two-Level,
28(3)250
- two-level,
25(1)63,
26(2)134,
28(3)250,
29(2)176,
29(5)451