At 10:04 AM 11/25/05, Arkadius Nowakowski wrote: >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.
Well, if it was my problem, I might try to have the lexer detect cases where a substring terminating " is followed by a & and another " (with possible intermediate whitespace) and throw away these characters without terminating the substring. Make the opening " change the lexer state to start looking for tokens of your second grammar and make the closing " change the lexer state back to the initial state. Dan -- Dan Haggarty Principal Consultant Dunhaven Inc. "advanced data architectures and business systems analysis" 416.234.8202 _______________________________________________ Help-bison@gnu.org http://lists.gnu.org/mailman/listinfo/help-bison