Although bytecode has many good features, it has slow execution speed and it is not an ideal representation for program analysis or optimization. For analysises and optimizations, bytecode must be translated to a Static Single Assignment Form(SSA Form). But when bytecode is translated a SSA Form it has lost type informations of some variables. For resolving these problemㄴ in this paper, we create extended control flow graph on bytecode. Also we convert the control flow graph to SSA Form for static analysis. Calculation about many informations such as dominator, immediate dominator, dominance frontier, -Function, renaming are required to convert to SSA Form. To obtain appropriate type for generated SSA Form, we proceed the followings. First, we construct call graph and derivation graph of classes. And the we collect informationㄴ associated with each node. After finding equivalence nodes and constructing Strongly Connected Component based on the collected informations, we assign type to each node.