關於Parsing Tree

[subsevenx2001]

我試著針對Stage1所有的Querry做Parsing Tree，發現生出來的樹非常相似，因此有機會僅用一個連續Tok的函式解決目前所需要的SQL queries

http://img.photobucket.com/albums/v282/subsevenx2001/IMG217.jpg

我目前在研究如何可以做有效率的Parsing，先把我做的Parsing Tree給大家參考

[blueworrybear]

Does it means regular expression wouldn't be used in this project? Anyway, it's an epic job. Let us know if there is anything we can help u.

[subsevenx2001]

2012/4/10 blueworrybear < reply@reply.github.com

Does it means regular expression wouldn't be used in this project? Anyway, it's an epic job. Let us know if there is anything we can help u.

---

Reply to this email directly or view it on GitHub:

https://github.com/blueworrybear/DataBaseProject1/issues/3#issuecomment-5041589

I've done a parsing node object that can rip all need argument for all queries in the 1st stage, I use parsing tree mixed with regular expression, which is a more efficient way, now I'm taking research on how to deal with the parsing leaves to make argument read operation more general

[subsevenx2001]

我已經把ParsingTree目前完成的部份存成Branch上傳，抱歉最近因為趕通識報告所以進度有點小慢

目前主要的關鍵是ParsingNode這個Class，只要在他的Contrustructor裡面輸入單句query，它就會回傳整句SQL 的ParsingTree，我之後會加入以In-fix Traversal Analysis來分析輸入的SQL是否合法的功能