Entry Bermudez:1991:UML 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{Bermudez:1991:UML,
  author =       "Manuel E. Bermudez",
  title =        "A unifying model for lookahead {LR} parsing",
  journal =      j-COMP-LANGS,
  volume =       "16",
  number =       "2",
  pages =        "167--178",
  month =        "????",
  year =         "1991",
  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,
  affiliation =  "Univ of Florida",
  affiliationaddress = "Gainesville, FL, USA",
  classcodes =   "C4210 (Formal logic)",
  classification = "723",
  corpsource =   "Dept. of Comput. and Inf. Sci., Florida Univ.,
                 Gainesville, FL, USA",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00960551",
  journalabr =   "Comput Lang",
  keywords =     "Algorithms; algorithms; arbitrary symbol lookahead;
                 Automata Theory --- Context Free Grammars; compilers;
                 Computer Programming; Computer Programming Languages;
                 construction; construction method; context-free
                 grammars; context-free languages; LALR; Lookahead FSA;
                 lookahead LR parsers; lookahead LR parsing; LR-Regular
                 class; NQLALR; parameters; Parsing; program; SLR;
                 unifying model; user-supplied; well-known grammar
                 classes",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

Related entries