Parallel balanced parenthesis matching

Raul Deluth Miller <rockwell@nova.umd.edu>
Sun, 16 Jan 1994 13:55:25 GMT

          From comp.compilers

Related articles
Parallel balanced parenthesis matching rockwell@nova.umd.edu (Raul Deluth Miller) (1994-01-16)
Re: Parallel balanced parenthesis matching rockwell@nova.umd.edu (1994-01-18)
Re: Parallel balanced parenthesis matching torbenm@diku.dk (1994-01-19)
Re: Parallel balanced parenthesis matching Jon.Hill@dcs.qmw.ac.uk (Jon Hill) (1994-01-20)
| List of all articles for this month |

Newsgroups: comp.compilers,comp.parallel
From: Raul Deluth Miller <rockwell@nova.umd.edu>
Keywords: parallel, parse
Organization: Compilers Central
Date: Sun, 16 Jan 1994 13:55:25 GMT

Balanced parenthesis matching is a cannonical example of a problem outside
the scope of regular expressions. Matching is normally accomplished using
a "FSM" in conjunction with a stack.


I was wondering if anyone has approached the problem with a massively
parallel machine [one machine per language element] and attempted to
minimize communication between machines. Of course, the problem changes
drastically, depending on the communication model. But I'm hoping to find
someone familiar with this kind of work.


Thanks,


Raul D. Miller
<rockwell@nova.umd.edu>
--


Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.