|Parsing Java email@example.com (s h) (2005-12-11)|
|Re: Parsing Java firstname.lastname@example.org (Scott Nicol) (2005-12-15)|
|Re: Parsing Java email@example.com (Florian Liekweg) (2005-12-15)|
|Re: Parsing Java firstname.lastname@example.org (Oliver Wong) (2005-12-15)|
|Re: Parsing Java email@example.com (s h) (2005-12-19)|
|From:||s h <firstname.lastname@example.org>|
|Date:||19 Dec 2005 00:10:18 -0500|
|Posted-Date:||19 Dec 2005 00:10:18 EST|
On 15 Dec 2005 02:20:13 -0500, Florian Liekweg <email@example.com> wrote:
> there's a couple of tools out there that can parse java code. One
> of them is RECODER (http://recoder.sf.net), which will make it
> easy to read in java code and build the call graph based on the
> information it computes automatically.
>I don't know what you mean by "task graph", but if such "tasks"
>can be extracted from the source code, then RECODER will be able
>to help you there, too.
TASK GRAPH is used in [distribution of code] ,when the parser is going
to generate intermediate code for for optimizing this code it can do
some algorithms for CSE common sub expersion elimination , constant
folding and ... if the parser have ability for generate distribution
code for parallel execution it must extract 2 things ( for example for
one java package)
first: lex and parse the code and extract call graphs and data
dependency graphs and control flow graphs
secound: then from this graphs ,it must find all instructins that
have same CFG and DDG and can put them in single TASK then from call
graph the compiler and findout that if this task can execute parallel
or not (from MAX execution time and MIN start time)
NOW I want to biuld a compiler that can lex and parse a simple java
package (with a simple grammer, not all of java) and generate
intermediate code then extract call graphs , DFG and DDG then make
task and task graph
BEST REGARDS ""
Return to the
Search the comp.compilers archives again.