Microsoft Technology Licensing, LLC

Jason J Shirk

Paul F Ringseth

Bruce Gordon Payette

Jonathan E Caves

Mark Lee Hall

Richard Thomas Russo

Thierry Miceli

Xiaoyong Zhou

Stephan Thomas Lavavej

Tanveer Ahmed Gani

Mitchell Warren Slep

Systems and methods for extending a programming language with a set of extensions using a strict meta-model are disclosed. Embodiments provide a set of interfaces that allow a schema to be synthesized. Syntax is introduced into an existing programming language to allow the construction of schematized data objects. A schema processor module translates a schema representation into new keywords. A document generator module receives the set of keywords and produces output in a selected form. When code comprising the keyword extensions is parsed, AST nodes represent keyword actions as a set of functions and implements those function calls with the original meta-data. A keyword definition comprises a name and an action to be taken at parse time and an action to be taken at runtime. The default action at parse time is to inject a function call into the code. The default action at runtime is to call the function.

Programming language with extensions using dynamic keywords

Many integrated development environments provide 'intelligent feedback' to developers. Current 'intelligent feedback' techniques may not work well with source code files comprising context sensitive programming languages because edits to one place in the code may change the meaning of arbitrary other places in the code, thus requiring additional full semantic parses to maintain correctness of the system. As provided herein, context-free &#x201c;name&#x201d; parsing may be performed to support entity candidate recursive semantic parsing in determining the meaning of the entity. A name parse may be performed to build and/or update a name table and a range table comprising names of entities and their positions within a source code file. Upon receiving a request to determine the meaning of a selected entity within the source code file, the tables may be queried to determine entity names and locations that are to be semantically parsed to determine a selected entity meaning.

Efficient incremental parsing of context sensitive programming languages

Unification of a programming language with a definition language creates a powerful tool for object-oriented programming. A programming language is extended to include definition language constructs. In a compiler environment, a compiler recognizes the definition language constructs in programming language code. The compiler environment unifies representation of the definition language information and programming language code in a unified parse tree, and derives semantic meaning from definition language information. The compiler environment also checks for lexical, syntax, and semantic errors.

Unification of a programming language and a definition language

Growing community of inventors

Woodinville, WA, United States of America

Jason J Shirk