|Parallel balanced parenthesis matching email@example.com (Raul Deluth Miller) (1994-01-16)|
|Re: Parallel balanced parenthesis matching firstname.lastname@example.org (1994-01-18)|
|Re: Parallel balanced parenthesis matching email@example.com (1994-01-19)|
|Re: Parallel balanced parenthesis matching Jon.Hill@dcs.qmw.ac.uk (Jon Hill) (1994-01-20)|
|From:||Raul Deluth Miller <firstname.lastname@example.org>|
|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.
Raul D. Miller
Return to the
Search the comp.compilers archives again.