Methods and Apparatus for Automatic Translation of a Computer Program Language Code

• US 20090313613A1
• Filed: 06/15/2009
• Published: 12/17/2009
• Est. Priority Date: 06/16/2008
• Status: Active Grant

• Current Assignee: Xenogenic Development Limited Liability Company (Intellectual Ventures LLC)
• Original Assignee: Real Dice, Inc. (888 Holdings PLC)
• Inventors: Lavian, Tal, Ben-Artzi, Amatzia, Alexevitch, Alexei, Glyakov, Alexander, Ben-Artzi, Guy, Shacham, Yotam, Levi, Yehuda, McMahon, Russell W.
• Granted Patent: US 8,762,962 B2
• Time in Patent Office: Days
• US Class Current: 717/137
• CPC Class Codes: G06F 8/51 Source to source

Abstract

Embodiments of the methods and apparatus for automatic cross language program code translation are provided. One or more characters of a source programming language code are tokenized to generate a list of tokens. Thereafter, the list of tokens is parsed to generate a grammatical data structure comprising one or more data nodes. The grammatical data structure may be an abstract syntax tree. The one or more data nodes of the grammatical data structure are processed to generate a document object model comprising one or more portable data nodes. Subsequently, the one or more portable data nodes in the document object model are analyzed to generate one or more characters of a target programming language code.

Claims

1. A method for automatic translation of a computer program language code, comprising:

tokenizing one or more characters of a source programming language code to generate a list of tokens;

parsing the list of tokens to generate a grammatical data structure, wherein the grammatical data structure comprises one or more data nodes;

processing the one or more data nodes of the grammatical data structure to generate a document object model, wherein the document object model comprises one or more portable data nodes; and

analyzing the one or more portable data nodes in the document object model to generate one or more characters of a target programming language code.

2. The method of claim 1, wherein the grammatical data structure comprises an abstract syntax tree.

3. The method of claim 1, wherein the source programming language and the target programming language are object oriented programming languages.

4. The method of claim 1 further comprising normalizing the source programming language, wherein one or more features of the source programming language are managed based on one or more features of the target programming language.

5. The method of claim 4, wherein the source programming language and the target programming language comprise one or more equivalent features.

6. The method of claim 4, further comprising downloading computer-executable instructions that, if executed by a computing device, cause the computing device to execute said normalizing.

7. The method of claim 4, wherein normalizing the source programming language comprises:

identifying one or more non-equivalent and one or more equivalent features from the one or more features in the source programming language, wherein the one or more non-equivalent features and the one or more equivalent features are identified based on the one or more features of the target programming language; and

removing the one or more non-equivalent features of the source programming language.

8. The method of claim 4 wherein normalizing the source programming language comprises:

identifying one or more non-equivalent features from the one or more features in the source programming language, wherein the one or more non-equivalent features are identified based on the one or more features of the target programming language; and

replacing the one or more non-equivalent features with the one or more equivalent features of the source programming language.

9. The method of claim 4 further comprising emulating the source programming language, wherein one or more non-equivalent features of the source programming language are emulated.

10. The method of claim 1, wherein tokenizing comprises processing the one or more characters of the source programming language code based on a set of expression rules.

11. The method of claim 1, wherein parsing comprises processing the list of tokens based on a set of grammar rules.

12. The method of claim 1, wherein processing the one or more data nodes of the grammatical data structure comprises:

scanning the one or more data nodes in the grammatical data structure to identify one or more metadata nodes; and

removing the one or more metadata nodes to generate the one or more portable data nodes.

13. The method of claim 1, wherein analyzing the one or more portable data nodes in the document object model comprises:

processing recursively the one or more portable data nodes in the document object model to generate a target list of tokens; and

analyzing the target list of tokens to generate the one or more characters of the target programming language code.

14. The method of claim 1, further comprising downloading computer-executable instructions that, if executed by a computing device, cause the computing device to execute said tokenizing.

15. The method of claim 1, further comprising downloading computer-executable instructions that, if executed by a computing device, cause the computing device to execute said parsing.

16. The method of claim 1, further comprising downloading computer-executable instructions that, if executed by a computing device, cause the computing device to execute said processing.

17. An apparatus for automatic translation of a computer program language code, the apparatus comprising.

a tokenizer configured to tokenize one or more characters of a source programming language code to generate a list of tokens;

a parser configured to parse the list of tokens to generate a grammatical data structure, wherein the grammatical data structure comprises one or more data nodes;

a generator configured to process the one or more data nodes of the grammatical data structure to generate a document object model, wherein the document object model comprises one or more portable data nodes; and

an analyzer configured to process the one or more portable data nodes in the document object model to generate one or more characters of a target programming language code.

18. The apparatus of claim 17, wherein the source programming language and the target programming language comprise one or more equivalent features.

19. The apparatus of claim 17, further comprising a normalizer configured to:

identify one or more non-equivalent and one or more equivalent features from the one or more features in the source programming language, wherein the one or more non-equivalent features and the one or more equivalent features are identified based on the one or more features of the target programming language; and

remove the one or more non-equivalent features of the source programming language.

20. The apparatus of claim 19, wherein the normalizer is further configured to remove the one or more non-equivalent features of the source programming language.

21. The apparatus of claim 17, wherein the tokenizer comprises a finite state machine.

22. The apparatus of claim 17, wherein the grammatical data structure comprises an abstract syntax tree.

23. The apparatus of claim 17, wherein the tokenizer is configured to process the one or more characters of the source programming language code based on a set of expression rules.

24. The apparatus of claim 17, wherein the parser is configured to process the list of tokens based on a set of grammar rules.

25. The apparatus of claim 17, wherein the generator is configured to scan the one or more data nodes in the grammatical data structure to identify one or more portable data nodes.

26. The apparatus of claim 17, wherein the analyzer is configured to recursively process the one or more portable data nodes in the document object model to generate a target list of tokens.

27. The apparatus of claim 17, further comprising an emulator configured to emulate one or more features non-equivalent of the source programming language.

28. The apparatus of claim 17, wherein the one or more data nodes in the abstract syntax tree represent a grammatical data structure of the list of tokens.

29. The apparatus of claim 17, wherein the generator is further configured to:

scan the one or more data nodes in the abstract syntax tree to identify one or more metadata nodes; and

remove the one or more metadata nodes to generate the one or more portable data nodes.

30. The apparatus of claim 17, wherein the analyzer is further configured to:

process recursively the one or more portable data nodes in the document object model to generate a target list of tokens; and

analyze the target list of tokens to generate the one or more characters of the target programming language code.

31. The apparatus of claim 17, wherein the source programming language and the target programming language are object oriented programming languages.

32. A computer-readable medium having computer-executable instructions for performing a method for language translation of a computer program code, said method comprising:

tokenizing one or more characters of a source programming language code to generate a list of tokens based on a set of expression rules;

parsing the list of tokens to generate a grammatical data structure based on a set of grammar rule, wherein the grammatical data structure comprises one or more data nodes;

processing the one or more data nodes of the grammatical data structure to generate a document object model, wherein the document object model comprises one or more portable nodes; and

analyzing the one or more portable nodes of the document object model to generate one or more characters of a target programming language code.

33. The computer-readable medium of claim 32, wherein the grammatical data structure comprises an abstract syntax tree.

34. The computer-readable medium of claim 32, wherein the list of tokens is parsed based on a set of grammar rules.

35. The computer-readable medium of claim 32, wherein the source programming language is a computer-game development language.

36. The computer-readable medium of claim 32, where processing the one or more data nodes of the grammatical data structure comprises:

scanning the one or more data nodes in the grammatical data structure to identify one or more metadata nodes; and

removing the one or more metadata nodes to generate the one or more portable data nodes.

37. The computer-readable medium of claim 32, wherein analyzing the one or more portable data nodes in the document object model comprises:

processing recursively the one or more portable data nodes in the document object model to generate a target list of tokens; and

analyzing the target list of tokens to generate the one or more characters of the target programming language code.

38. The computer-readable medium of claim 32, wherein the source programming language and the target programming language are object oriented programming languages.

39. A system for automatic translation of a computer program language code, comprising:

means for tokenizing one or more characters of a source programming language code to generate a list of tokens;

means for parsing the list of tokens to generate a grammatical data structure, wherein the grammatical data structure comprises one or more data nodes;

means for processing the one or more data nodes of the grammatical data structure to generate a document object model, wherein the document object model comprises one or more portable data nodes; and

means for analyzing the one or more portable data nodes in the document object model to generate one or more characters of a target programming language code.

40. The system of claim 39, wherein the grammatical data structure comprises an abstract syntax tree.

41. The system of claim 39, wherein the list of tokens comprises one or more categorized blocks of the one or more characters of the source programming language code.

42. The system of claim 39, wherein the source programming language is a computer-game development language.

43. The system of claim 39, wherein the target programming language is a computer-game development language.

44. The system of claim 39 further comprising means for normalizing the source programming language, wherein one or more features of the source programming language are managed based on one or more features of the target programming language

45. The system of claim 44, wherein the means for normalizing the source programming language comprises:

means for identifying one or more non-equivalent and one or more equivalent features from the one or more features in the source programming language, wherein the one or more non-equivalent features and the one or more equivalent features are identified based on the one or more features of the target programming language; and

means for removing the one or more non-equivalent features of the source programming language

46. The system of claim 39, wherein the means for processing the grammatical data structure comprises:

means for scanning the one or more data nodes in the grammatical data structure to identify one or more metadata nodes; and

means for removing the one or more metadata nodes to generate the one or more portable data nodes.

47. The system of claim 39, wherein the means for analyzing the one or more portable data nodes in the document object model comprises:

means for processing recursively the one or more portable data nodes in the document object model to generate a target list of tokens; and

means for analyzing the target list of tokens to generate the one or more characters of the target programming language code.

48. The system of claim 39, wherein the source programming language and the target programming language are object oriented programming languages.

49. A method for automatic translation of computer programming language code written in a source programming language to obtain computer programming language code in a target programming language, comprising:

identifying one or more non-equivalent and one or more equivalent features in the source programming language, wherein the one or more non-equivalent features and the one or more equivalent features are identified based on features of the target programming language; and

performing, to obtain processed source code, at least one operation selected from the group consisting of;

removing the one or more non-equivalent features of the source programming language; and

replacing the one or more non-equivalent features with the one or more equivalent features of the source programming language; and

translating the processed source code into the target programming language.

50. The method of claim 49 further comprising emulating one or more non-equivalent features of the source programming language.

51. The method of claim 49, further comprising downloading computer-executable instructions that, if executed by a computing device, cause the computing device to execute said identifying, said performing, and said translating.

52. The method of claim 49, further comprising providing for download computer-executable instructions that, if executed by a computing device, cause the computing device to execute said identifying, said performing, and said translating.

53. A computer-readable medium having computer-executable instructions for performing the method of claim 49.