Entry Haripriyan:1988:CWS from complngs.bib

Last update: Thu Jun 20 02:00:37 MDT 2019                Valid HTML 4.0!

Index sections

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{Haripriyan:1988:CWS,
  author =       "H. K. Haripriyan and Y. N. Srikant and Priti Shankar",
  title =        "A compiler writing system based on affix grammars",
  journal =      j-COMP-LANGS,
  volume =       "13",
  number =       "1",
  pages =        "1--11",
  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 = "Indian Inst of Science, Bangalore, India",
  classcodes =   "C4210 (Formal logic); C6150C (Compilers, interpreters
                 and other processors)",
  classification = "721; 723",
  corpsource =   "Dept. of Comput. Sci. and Autom., Indian Inst. of
                 Sci., Bangalore, India",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00960551",
  journalabr =   "Comput Lang",
  keywords =     "affix grammars; algorithm; Algorithms; automata theory
                 --- Grammars; automatic compiler generation; bottom-up
                 parsing; compiler writing; compiler writing system;
                 computer programming; deterministic; formal languages;
                 grammars; one-pass; parsing; Pohlmann; program
                 compilers; space requirements; suitability; system;
                 testing; translation",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

Related entries