Tue, 27 Oct 1992 18:02:41 GMT

Related articles |
---|

Grammar Algebra? hallpwcd@ucunix.san.uc.EDU (1992-10-26) |

Re: Grammar Algebra? wand@dec5120z.ccs.northeastern.edu (1992-10-27) |

Re: Grammar Algebra? hallpwcd@ucunix.san.uc.EDU (1992-10-31) |

Re: Grammar Algebra? jan@klikspaan.si.hhs.nl (1992-11-02) |

Re: Grammar Algebra? hdev@dutiaj.twi.tudelft.nl (1992-11-03) |

Re: Grammar Algebra? Peter.Breuer@prg.oxford.ac.uk (1992-11-04) |

Newsgroups: | comp.compilers |

From: | wand@dec5120z.ccs.northeastern.edu (Mitchell Wand) |

Organization: | College of Computer Science, Northeastern University |

Date: | Tue, 27 Oct 1992 18:02:41 GMT |

Keywords: | parse, theory |

References: | 92-10-099 |

hallpwcd@ucunix.san.uc.EDU (Phillip W. Hall) writes:

Can anyone point to references concerning research on

operations on grammars?

For example: what does it mean to add, subtract, compose,

or concatenate grammars?

It certainly makes sense to perform these operations on languages, and

then you can ask whether there is an algorithm which, given grammars G1

and G2, will produce a grammar for (say) L(G1) - L(G2). This kind of

thing should be in any elementary automata theory book.

Or did you have something else in mind?

--Mitch

--

Mitchell Wand

College of Computer Science, Northeastern University

360 Huntington Avenue #161CN, Boston, MA 02115 Phone: (617) 437 2072

Internet: wand@flora.ccs.northeastern.edu Fax: (617) 437 5121

--

Post a followup to this message

Return to the
comp.compilers page.

Search the
comp.compilers archives again.