Method and system for creating programs using code having coupled syntactic and semantic relationship
OwnerNile Geisingerinventor
Life of this patent
Estimating the term…
Abstract
A new fundamental unit of programming which couples semantic and syntactic relationships, and a system for compiling those units and programs written in those units. A Sym is comprised of a Name, an Inherit Statement, a Self Description, and a Definition. Syms couple syntactic and semantic relationships through their use of Syntactic References in their Self Description and Semantic References in their Definition. Syms and programs written in Syms are compiled through the Sym Execution System.
Claims20
A method in a computer system for generating runnable code of arbitrary syntactic and semantic complexity, the method comprising:
- reading in a first Sym comprising a unit of code that couples state-based semantic relationships with syntactic relationships;
- and
- generating runnable code based on the first Sym.
A computer system for generating runnable code of arbitrary syntactic and semantic complexity, the computer system comprising:
- a first Sym comprising a unit of code that couples state-based semantic relationships with syntactic relationships;
- and
- a compiler that reads the first Sym and generates runnable code.
A method in a computer system for generating runnable code, the method comprising:
- describing in a first unit of code at least one legal relationship among a collection comprised of units of code and/or tokens;
- encapsulating in the first unit of code at least one meaning comprised of a behavior and state for the at least one legal relationship among units of code and/or tokens in the collection;
- allowing the at least one meaning to be accessed through the at least one legal relationship to compose at least part of a meaning of a second unit of code;
- and
- generating runnable code based on the first and/or second unit of code.
A computer system for generating runnable code, comprising:
- a first unit of code that comprises a description of at least one legal relationship among a collection comprised of units of code and/or tokens;
- a definition in the first unit of code that encapsulates at least one meaning comprised of a behavior and state for the at least one legal relationship among units of code and/or tokens in the collection;
- a translator that allows the at least one meaning to be accessed through the at least one legal relationship to compose at least part of a meaning of a second unit of code;
- and
- means for generating runnable code based on the first and/or second unit of code.
Dependencies are inferred from the claim text.