Compilation apparatus and compiling method
AssigneeFujitsu Limited
InventorYuki KAWAGUCHI
Life of this patent
Estimating the term…
Abstract
A compilation apparatus includes a memory; and a processor coupled to the memory and the processor configured to: add a syntax tree for indicating a first function that declares a reference to data of a parse tree created based on a source code when compiling the source code, the reference being a function for a right-hand-side value reference, and rewrite the data of the parse tree when the first function that declares the reference is not detected and a specific second function different from the first function is detected from data of the parse tree.
Claims10
A compilation apparatus comprising:
- a memory;
- and
- a processor coupled to the memory and the processor configured to:
- add a syntax tree for indicating a first function that declares a reference to data of a parse tree created based on a source code when compiling the source code, the reference being a function for a right-hand-side value reference, and
- rewrite the data of the parse tree when the first function that declares the reference is not detected and a specific second function different from the first function is detected from data of the parse tree.
A compiling method for compiling a source code with a computer, the method comprising:
- adding a syntax tree that indicates a first function that declares a reference to data of a parse tree created based on the source code, the reference being a function for a right-hand-side value reference, and
- rewriting the data of the parse tree when the first function that declares the reference is not detected and a specific second function different from the first function is detected from the data of the parse tree.
A non-transitory, computer-readable recording medium having stored therein a program for causing a computer to execute a process, the process comprising:
- adding a syntax tree for indicating a first function that declares a reference to data of a parse tree created based on the source code, the reference being a function for a right-hand-side value reference, and
- rewriting the data of the parse tree when the first function that declares the reference is not detected and a specific second function different from the first function is detected from data of the parse tree.
Dependencies are inferred from the claim text.