From: Daniel Baird Date: 2006-06-05T15:32:11+09:00 Subject: parsing a boolean expression ------=_Part_5881_20848228.1149489127753 Content-Type: text/plain; charset=ISO-8859-1; format=flowed Content-Transfer-Encoding: 7bit Content-Disposition: inline Hi all, I need to take a string typed by dirty users' fingers, that should contain a boolean expression, like this: one and (two or three or (four and five) or six) and (seven or eight) ..and parse it into some kind of sensible data structure, like a tree or something. Or reject it if it's mal-formed. I figure it might take me two or three days to write and debug from scratch (..hey, I'm fairly new to Ruby :\ ), but I'm sure there's a library somewhere that will do the job. I've tried searching for bool*, expr* and pars* in fxri but didn't get anything, and Googling just tells me that my search terms are too generic to find what I want. Any suggestions? Thanks in advance! ;Daniel -- Daniel Baird http://danielbaird.com (TiddlyW;nks! :: Whiteboard Koala :: Blog :: Things That Suck) ------=_Part_5881_20848228.1149489127753--