Parsing implicit operators with recursive descent?

Hi all,


Is it possible to parse implicit operators, like the regular
expression concatenation operator, with a recursive descent parser?


Both of the RE recursive descent parsers I've come across on the 'net
preprocess the input to insert a token for concat, one with postfix,
the other infix.


That is, to be explicit, is it possible to make a recursive descent
parser that produces (*) the following parse tree on this input "aab":


                                                                    @
                                                                  / \
                                                                @ b
                                                              / \
                                                            a a


Where @ is the implicit concatenation operator?


Johann


(*) For some value of `produce'.

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