Computer source code generator

• US 8,549,489 B2
• Filed: 06/11/2010
• Issued: 10/01/2013
• Est. Priority Date: 07/01/2005
• Status: Expired due to Fees

• Current Assignee: Ronald Ortscheid
• Original Assignee: Ronald Ortscheid
• Inventors: Ortscheid, Ronald
• Primary Examiner(s): CHAVIS, JOHN Q
• Application Number:
  US12/814,385
• Publication Number:
  US 20100257512A1
• Time in Patent Office: 1,208 Days
• Field of Search: 717/131
• US Class Current: 717/131
• CPC Class Codes: G06F 8/33 Intelligent editors

Abstract

A programming editor and creator allows users with minimal knowledge of a computer language syntax to generate computer source code using a structured rather than freeform process. A predefined command sentence is provided representing at least a portion of a programming command, and includes words, which may be defined as constant or enterable words. Enterable words may be required or optional, and correspond to entry components. Each word may be defined according to word types, including list words, variable list words, variable words, mathematical words, condition words or Boolean words. Enterable words may include repeatable words which may be inserted multiple times within a command to create conditional statements, mathematical equations and string concatenations. Input values are provided for the entry components. The predefined command sentence with the input values is converted to a completed command sentence corresponding to the programming command, which is translated to a target programming language.

Claims

1. A method of computer programming for a target programming language, wherein the computer programming includes at least one programming command, the method comprising:

providing, by a processor, a predefined command having a defined word, wherein the predefined command is expressed as a predefined command sentence comprising at least a portion of a programming command and a structure other than a syntax of the target programming language, wherein the target programming language is a lower level language and the structure is part of a structured high-level language comprising natural language elements with abstraction from the target programming language;

providing, by the processor, an entry component corresponding to the word in the predefined command, the entry component provided consistent with the definition of the word independent of the target programming language and being modifiable in response to a user input;

receiving, by the processor, data relating to an input value for the entry component;

converting, by the processor, the predefined command and the input value for the entry component into a completed programming command in the high-level language; and

expressing, by the processor, the completed programming command to the user as a completed command sentence, wherein the completed command sentence comprises the structured high-level language comprising natural language elements with abstraction from the target programming language.

2. The method of claim 1 wherein the predefined command comprises an enterable word and a constant word, wherein the entry component corresponds to the enterable word.

3. The method of claim 2 wherein the enterable word comprises one of the following:

an optional word wherein the input value is optional or a required word wherein the input value is required.

4. The method of claim 3 wherein the predefined command comprises a first optional word and a second optional word, the method further comprising:

receiving, by the processor, data relating to an input value for the first optional word; and

causing, by the processor, the second optional word to become a required word based on the input value for the first optional word.

5. The method of claim 2 wherein the enterable word comprises a repeatable word, the method further comprising inserting, by the processor, the repeatable word one or more times within the predefined command.

6. The method of claim 5 wherein the predefined command comprises at least one of the group consisting of:

a mathematical equation, a string concatenation and a conditional statement.

7. The method of claim 5 wherein the repeatable word comprises at least one of the group consisting of:

a Boolean, a list word, a variable list word, a condition word, a mathematical word and a variable word.

8. The method of claim 2 wherein the enterable word comprises a Boolean word and wherein the input value comprises a true/false value.

9. The method of claim 2 wherein the enterable word comprises a list word comprising two or more options, and wherein the input value comprises an option selected from the list word.

10. The method of claim 9 wherein the option selected from the list word represents at least one of the group consisting of:

a procedure variable, a public variable and a repeat block loop variable.

11. The method of claim 2 wherein the enterable word comprises a variable list word comprising two or more options with at least one option comprising an enterable word, and wherein the input value comprises an option selected from the variable list word, the method further comprising:

providing, by the processor, an entry component corresponding to the enterable word of the selected option; and

receiving, by the processor, data relating to an input value for the entry component corresponding to the enterable word of the selected option.

12. The method of claim 2 wherein the enterable word comprises a condition word comprising a first condition value logically related to a second condition value.

13. The method of claim 12 wherein the programming command comprises a compound condition comprising a first condition word related to a second condition word.

14. The method of claim 13 wherein the programming command comprises a conditional statement comprising a first compound condition related to a second compound condition.

15. The method of claim 14 further comprising:

organizing, by the processor, the condition words of the first compound condition according to a first outline;

organizing, by the processor, the condition words of the second compound condition according to a second outline; and

relating, by the processor, the first outline to the second outline.

16. The method of claim 2 wherein the enterable word comprises a mathematical word, and wherein the input value comprises at least one of the group consisting of:

a numeric value, numeric variable, a variable convertible to a numeric value.

17. The method of claim 16 wherein the programming command comprises a mathematical equation comprising a first mathematical word mathematically related to a second mathematical word.

18. The method of claim 2 wherein the enterable word comprises a variable word, and wherein the input value comprises at least one of the group consisting of:

a string, an integer, a floating point number, an alphanumeric, a date, a data file location, an object, a Boolean and an array.

19. The method of claim 1 wherein converting the predefined command sentence and the input value for the entry component into a completed programming command comprises converting the input value for the entry component into at least one of the following:

a word of the programming command, a phrase of the programming command or a clause of the programming command.

20. The method of claim 1, further comprising:

providing, by the processor, a menu comprising a plurality of selectable programming commands;

receiving, by the processor, data relating to a programming command selected from the plurality of programming commands; and

providing, by the processor, the selected programming command as the predefined command sentence.

21. The method of claim 1, further comprising:

analyzing, by the processor, the completed programming command for errors; and

providing, by the processor, notification of an occurrence of an error.

22. The method of claim 1, further comprising defining the predefined command.

23. The method of claim 22 wherein defining the predefined command further comprises defining each word within the predefined command.

24. The method of claim 23 wherein defining a word comprises:

selecting, by the processor, a word type; and

defining, by the processor, the word as the selected word type.

25. The method of claim 22 wherein the predefined command comprises at least one word and wherein defining the predefined command comprises:

inserting, by the processor, a word into the predefined command;

deleting, by the processor, a word from the predefined command;

modifying, by the processor, a definition of a word of the predefined command; and

writing, by the processor, a translation procedure for the predefined command.

26. The method of claim 1, further comprising translating, by the processor, the completed programming command to the target programming language.

27. The method of claim 26 wherein translating the completed programming command to the target programming language comprises converting, by the processor, the completed programming command into one or more instructions in the target programming language.

28. The method of claim 26 wherein translating the completed programming command to the target programming language comprises utilizing, by the processor, a code generator assigned to the programming command.

29. The method of claim 26 wherein translating the completed programming command to the target programming language comprises translating, by the processor, the completed programming command to at least one of the group consisting of:

a hypertext markup language, an extensible markup language, C or other 3rd generation programming language, C++ or other 4th/5th generation programming language, Pearl, Javascript®

or other script language, and a word processing macro language or other macro language.

30. The method of claim 1 wherein the target programming language comprises at least one of the group consisting of:

a macro, a script, a computer source code, an object code, a machine code, and interpreted code, a markup language and a computer document.