Entry Leermakers:1992:RAP from tcs1990.bib

Last update: Wed Sep 26 02:11:46 MDT 2018                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{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