Parallel balanced parenthesis matching

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>
--

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