[
https://issues.apache.org/jira/browse/DERBY-3946?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=12647600#action_12647600
]
Christian Riedel commented on DERBY-3946:
-----------------------------------------
Rick,
your patch has helped us a lot so far ... since I cannot post any messages to
the list for some reason, I want to give my feedback here.
getting hold of the QueryTreeNode is a big step in the right direction ...
however for actually analyzing the tree it would be necessary to access the
tree's elements. I.e. traverse the tree sequentially, getting information how
many childnodes exist etc. The problem that I still see is that some of the
classes I'd need for this are not visible so that I can use the from the
outside.
The QueryTreeNode in your example code seems to be an instance of CursorNode
... how can I go on from here?
The things we'd like to know is: which tables are involved in the statement
(also in inner selects) which fields from which tables are accessed, which
aliases are given for the tables that are accessed etc.
Could you give me a further hint?
Thanks
Christian
> Provide support for using the Derby parser to generate Abstract Syntax Trees
> ----------------------------------------------------------------------------
>
> Key: DERBY-3946
> URL: https://issues.apache.org/jira/browse/DERBY-3946
> Project: Derby
> Issue Type: New Feature
> Components: SQL
> Affects Versions: 10.5.0.0
> Reporter: Rick Hillegas
> Fix For: 10.5.0.0
>
> Attachments: ASTParser.java, derby-3946-01-aa-standaloneParser.diff
>
>
> Users would like to be able to use the Derby parser to produce query trees
> without actually running the queries on Derby.
--
This message is automatically generated by JIRA.
-
You can reply to this email to add a comment to the issue online.
