13 Oct 91 18:11:37 +0100

Related articles |
---|

LR(n) parsers whatis@ucsd.edu (Steve Boswell) (1991-10-10) |

Re: LR(n) parsers KARSTEN@tfl.dk (Karsten Nyblad, TFL, Denmark) (1991-10-13) |

Re: LR(n) parsers goer@midway.uchicago.edu (1991-10-14) |

Re: LR(n) parsers sra@ecs.soton.ac.uk (1991-10-14) |

Re: LR(n) parsers anw@maths.nott.ac.uk (1991-10-14) |

Re: LR(n) parsers bburshte@pyrps5.eng.pyramid.com (1991-10-14) |

Re: LR(n) parsers mareb@levels.unisa.edu.au (1991-10-15) |

Re: LR(n) parsers nickh@harlqn.co.uk (Nick Haines) (1991-10-16) |

[9 later articles] |

Newsgroups: | comp.compilers |

From: | "Karsten Nyblad, TFL, Denmark" <KARSTEN@tfl.dk> |

Keywords: | parse, bibliography, LR(1) |

Organization: | TFL, A Danish Telecommunication Research Laboratory |

References: | 91-10-036 |

Date: | 13 Oct 91 18:11:37 +0100 |

The report "A Practical State Splitting Algorithm for Constructing

LR-parser" describes how to generate lookahead sets and split states so

that that usual LR(0) parsing automaton can accept LR(K) grammar. The

algorithm can detect when further state splitting does not give anything.

I.e. this report tells you how to convert an LALR(1) or SLR(1) parser

generator into and LR(K) generator. The report is based on the algorithm

for calculating lookahead set developed by the authors. That algorithm

was made before DeRemer and Pennello discovered that Tarjans algorithm for

finding strongly connected components could speed up algorithms for

lookahead set. Later results show that combining the authors' and

Tarjan's algorithms gives a very fast lookahead set generating algorithm.

I have another report describing how to extend DeRemer and Pennello

algorithm for lookaheads sets for LALR(1) parser to LALR(K).

"A Practical State Splitting Algorithm for Constructing LR-parsers"

Bent Bruun Kristensen and Ole Lehrmann Madsen

Report number DAIMI PB-115

Available from:

Computer Science Department

AARHUS UNIVERSITY

Ny Munkegade

DK-8000 Aarhus C

Denmark

"Efficient Computation of LALR(k) Look-Ahead sets"

Gurli Rohde

Available from me. (I will need your ordinary mail address).

Karsten Nyblad

TFL, A Danish Telecommunication Research Laboratory

E-mail: karsten@tfl.dk

--

Post a followup to this message

Return to the
comp.compilers page.

Search the
comp.compilers archives again.