Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • 1980-1984  (2)
  • 1
    Electronic Resource
    Electronic Resource
    UCCA admissions (1983)
    [s.l.] : Nature Publishing Group
    Nature 301 (1983), S. 106-106 
    Details
    ISSN: 1476-4687
    Source: Nature Archives 1869 - 2009
    Topics: Biology , Chemistry and Pharmacology , Medicine , Natural Sciences in General , Physics
    Notes: [Auszug] SIR - The leading article in y our issue of25 November 1982 (p.302) contains the statement ". . . . their (the universities') willingness to delegate the selection of the students whom they will teach to a computer centre in Cheltenham is a proof that they are only half serious". There is no such ...
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1038/301106c0
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    LALR(1, 1) parser generation for regular right part grammars (1984)
    Springer
    Acta informatica 21 (1984), S. 29-45 
    Details
    ISSN: 1432-0525
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Summary Commonly used extensions to BNF can be modelled by the formalism of regular right part grammars. A method for building LR parsers for such grammars is given, which works by first constructing an LR(0) automaton and then augmenting it with readback machines constructed to recognize the reverse of the state sequences leading to a reduction. The state sequences which will be accepted by such readback machines are also the sequences which link reductions to their lookback states (states in which the parser may be re-started after the reduction), which are needed in order to compute LALR(1) lookahead sets using the algorithm devised recently by DeRemer and Pennello. An algorithm is presented which computes these lookback states using the structure of the LR(0) automaton, and it is shown how this can easily be extended to build readback machines at the same time.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00289138
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...