Bea Systems, Inc.

Oracle International Corporation

Kevin Zatloukal

Tim A Wagner

John McEnerney

David G Garber

Britton Worth Piehler

An extensible, data-driven, language independent source code editor is presented, with an embedded, extensible multi-language compiler framework. Such an editor can be tightly integrated with a compiler framework that provides detailed information about the language currently being edited by the user. This information can be provided in a language-neutral way effectively decoupling the editor from the underlying set of languages being edited. In addition, a language-independent editor can expose a set of APIs that makes it easy to customize behavior for specific languages that have characteristics not shared by most languages. This set of APIs can also enable the development of customized views, such as for developing visual editors that represent and allow the user to manipulate aspects of the source code pictorially. This description is not intended to be a complete description of, or limit the scope of, the invention. Other features, aspects, and objects of the invention can be obtained from a review of the specification, the figures, and the claims.

Methods for type-independent source code editing

A system and method for compiler error recovery, comprising analyzing the syntactic structure of a first program in a first programming language, wherein the first program can be represented by a first set of tokens, detecting a syntax error in the first program, remedying the syntax error by adding at least one token to the first set of tokens according to one of: 1) a prefix definition; and 2) an idiom definition, and wherein the detection of the syntax error occurs at the behest of an extensible compiler framework.

System and method for performing error recovery in an integrated development environment

A system that provides programming language translation includes a first compiler that compiles a source file in a first programming language into a parsed representation of the first programming language, and a transformation component that receives the parsed representation and generates a token stream from the parsed representation. The token stream comprises second language tokens of a second programming language and at least one compilation phase of the first compiler is skipped. The system further includes a second compiler that compiles the token stream into an object code and skips at least one compilation phase of the second compiler. The transformation component provides the token stream to the second compiler in memory.

Method and system for translating programming languages

The present invention generates state machines that can be used in a scanner and/or a parser for software program compilation. The state machines are not table-driven, but rather are encoded directly by creating jumps and branches in bytecodes, which are machine-independent codes generated by a Java compiler and can be executed on any Java-enabled device. Such state machines can be much faster than those based on tables, and much smaller in code size than those implemented in executable codes. In addition, such state machines can be optimized to reduce the number of states and the amount of codes required to encode each state in it. This can allow these state machines to meet strict code size restrictions specified by certain virtual machines, such as the Java virtual machine.

System and method for generating state machines

A system to provide an extensible type repository environment can include one or more type repositories, each of which is capable of representing a type system and maintaining one or more type definitions, each representing a type in the type system. Each type repository can also define a type repository interface, which is capable of providing a standard set of services for use by the system in interacting with the type repository. In addition, a compiler is capable of translating types defined in one or more language modules into types defined in one or more type repositories, performing name resolution, maintaining and resolving dependencies among types during recompilation of the types. This description is not intended to be a complete description of, or limit the scope of, the invention. Other features, aspects, and objects of the invention can be obtained from a review of the specification, the figures, and the claims.

System and method for extensible type repositories

State machines can be used in a scanner and a parser for program compilation. The state machines can be non-table-driven, but rather are encoded directly in bytecodes. A special algorithm can be used to generate the multi-way branch associated with a state in a state machine so that the multi-way branch meets specified optimality requirements on the size of the bytecodes. The bytecodes so implemented can be more compact and run faster than those generated un-optimized. The algorithm for obtaining an optimal implementation of the multi-way branch can be conceptually divided into three phases: first, it constructs a set of subarrays that form a disjoint covering for the target array; second, it determines an optimal branch implementation for each subarray; and third, it determines the optimal branch implementation for each union of one or more adjacent subarrays, culminating to the optimal implementation for the entire target array. This description is not intended to be a complete description of, or limit the scope of, the invention. Other features, aspects, and objects of the invention can be obtained from a review of the specification, the figures, and the claims.

System and method for generating multi-way branches

To meet the current trend in computer programming, a multi-programming-language compiler system is designed to include a compiler framework which creates a general environment in which to carry out compilation and language modules to encapsulate the details of various programming languages. Such a system makes it easy for tool vendors and end users to adapt to a world where computer programs are written in multiple languages. New language modules may be written that add support for new languages to the compiler framework. It may also be possible to extend existing language modules so that a variant on an existing language may be added to the compiler framework. Such a system may also be adapted to permit several different clients to access detailed language information from the compiler framework. These clients may include a standard command-line shell or a sophisticated multi-language integrated development environment. This description is not intended to be a complete description of, or limit the scope of, the invention. Other features, aspects, and objects of the invention can be obtained from a review of the specification, the figures, and the claims.

Extendable compiler framework

A system and method for code completion, comprising providing a representation of a first program in a first programming language, establishing a location in the first program, associating the location with a representation of the first program, obtaining code completion information relevant to the location in the first program based on the representation of the first program, and wherein the obtaining occurs at the behest of an extensible compiler framework.

Growing community of inventors

Cambridge, MA, United States of America

Kevin Zatloukal