Hello again, I've got to parse a grammar (BSDL) that contains strings. That strings furthermore contain information which has to be parsed. The problem lies in the concatenation of the BSDL strings:
" substring_1 " & " substring_2 " & ... " substring_n " What I have to do now is build the whole string and parse its content: " substring_1 substring_2 ... substring_n " Don't know if I'm right, but I guess the complete string has to be a terminal. And I have to call bison in a recursvie way to parse the content of the string. I've searched the internet but I could not find enough information how to do this. Thanks in advance!!! Best regards. -- Arkadius Nowakowski email : [EMAIL PROTECTED] gnupg : http://www.fh-augsburg.de/~nowarek/anowa.gpg icq# : 107518121 jabber : [EMAIL PROTECTED] -o) msn : [EMAIL PROTECTED] /\\ _\_V Message void if penguin violated ... Don't mess with the penguin _______________________________________________ Help-bison@gnu.org http://lists.gnu.org/mailman/listinfo/help-bison
