22 Oct 1998 02:00:25 -0400

Related articles |
---|

PDAs and regular expressions pseale@ix.netcom.com (pseale) (1998-10-22) |

Re: PDAs and regular expressions glenn.langemeier@gmx.net (1998-10-24) |

Re: PDAs and regular expressions bromage@cs.mu.OZ.AU (1998-10-24) |

From: | "pseale" <pseale@ix.netcom.com> |

Newsgroups: | comp.compilers |

Date: | 22 Oct 1998 02:00:25 -0400 |

Organization: | ICGNetcom |

Keywords: | parse, theory |

Hi all,

Wasn't sure where to direct this question, I thought this group might

have some answers.

Given a pushdown automaton, I wonder:

- what the weakest grammatical model is that can describe the possible

contents of the pushdown tape in any given state (for instance, a regular

expression) and

- if so, has anyone developed an algorithm to compute this.

Any references would be appreciated.

Paul

Post a followup to this message

Return to the
comp.compilers page.

Search the
comp.compilers archives again.