Sun Microsystems, Inc.

Oracle International Corporation

Michael L Van De Vanter

Mario I Wolczko

John C Tang

Donald R Gentner

Nicole Y Mordecai

James M A Begole

Douglas Norman Simon

Benjamin Lawrence Titzer

Marat Boshernitsan

Kenneth B Urquhart

Hannes E Payer

A method for managing an object watchpoint during a garbage collection cycle, including identifying an object having a field, where the object is associated with an original object location, where the field is associated with an original field location, and where the object and the field are located in a memory heap of a virtual machine memory, setting, within a debugger, the object watchpoint on the original field location, where the object watchpoint is a memory trap associated with the object, determining, after a relocation of the object by a garbage collector (GC), a new object location associated with the object, determining a new field location of the field based on the new object location, and setting, within the debugger, the object watchpoint on the new field location.

Tracking object fields using relocatable object watchpoints

An editor or software engineering tool may be configured to represent program code as a doubly-linked list of lexical tokens and to maintain, coincident with an operation that modifies contents of the list, an undo object that identifies opposing end nodes of a sublist of one or more lexical tokens corresponding to a substring that is either inserted into or removed from the list by the operation. In this way, lexical tokens corresponding to an inserted substring can be readily and efficiently excised to restore a pre-insertion tokenized list state. Similarly, lexical tokens corresponding to a removed substring can be readily and efficiently reinstated to restore a pre-deletion tokenized list state. Advantageously, undo support once employed to restore a prior tokenized list state is symmetrically available to support redo operations. In some embodiments in accordance with the present invention, undo-redo entries are maintained in an operation ordered set that is traversed to support one or more operations in either the undo or redo directions. In some realizations, such an ordered set of undo-redo entries is maintained by, or in conjunction with, an undo-redo manager.

Undo/redo technique for token-oriented representation of program code

The present invention provides a method and apparatus for accessing related computer objects. In one embodiment, computer objects related to a user's current task by a metric are listed. In another embodiment, other users related to a user's current task by a metric are listed. In one embodiment, the metric used to determine whether a user is related to a computer object determines whether the user accessed the computer object. In another embodiment, the metric used to determine whether a user is related to a computer object determines whether the user is referenced in the computer object. In other embodiments, the metric used to determine whether a user is related to a computer object involves other measures of relatedness. In one embodiment, the metric used to determine whether a computer object is related to another computer object determines whether the computer objects have a related user in common.

Method and apparatus for accessing related computer objects

In response to programmer input of a trigger token, a program editor creates a pair of boundary tokens encapsulating an embedded lexical context and positions an insertion point within the embedded lexical context. The operations on the embedded lexical context are preferably performed using an embeddable sub-editor specialized to the task at hand. Since boundary tokens are generated in pairs, stability of lexical boundaries is enforced. Accordingly, stable implementations of certain desirable behaviors, including language-oriented advanced program typography that is robust to user edits, are facilitated using the invented techniques.

Interactive software engineering tool with support for embedded lexical contexts

An editor or software engineering tool may be configured to render whitespace between adjacent tokens, wherein the amount of whitespace between any two adjacent tokens is determined according to language-specific style rules and scaled in accordance with display considerations. In some realizations, the operative scaling is selected or defined by a user according to the user's visual preferences. In some realizations, the operative scaling relates to requirements or constraints of an automated layout mechanism. For example, a particular scaling may be calculated to adjust line length in conformance with a desired margin alignment or to optimize layout when long lines are automatically wrapped (or folded) in some automatic way.

Language-sensitive whitespace adjustment in a software engineering tool

An editor for structurally represented computer programs transforms user-entered text on-the-fly into a stream of tokens that constitute words of the program under edit. Each token is classified as one of group of extended lexemes, and based upon token stream information the editor prettyprint displays the program as the user types. Prettyprinting involves typesetting each token in a visually distinct manner and displaying a varying amount of visual inter-token whitespace between the tokens, based upon token lexical type. The program may be user-edited from the prettyprinted display as though the program were internally represented as text. Cursor position and display appearance depend on the lexical types of tokens adjacent the cursor. To improve aesthetics of the prettyprinted display, a user may insert one or more alignment markers into lines of associated text. The presence of such marker(s) forces horizontal alignment between associated text lines containing such markers. The presence, number, and occurrence of such markers in associated lines of text is noted, and the pixel distance from a boundary edge to the first occurring marker in each line is calculated. The maximum such distance determines relative position of the first alignment marker. Pixel units are added to the whitespace gap preceding the first marker in the other associated lines to force such markers into alignment with the marker whose position represented the maximum distance. This process is then repeated for second alignment markers in each line, third alignment markers, and so on.

System and method for horizontal alignment of tokens in a structural

A user-friendly text editor for structurally represented computer programs is disclosed. The present editor combines advantages of text editors and structure editors by transforming, as the user types, the text stream entered by the user into a token stream, where the tokens of the token stream constitute the words of the program being entered. Each of the tokens is classified by the editor as one of a group of extended lexemes defined by the language in which the program being edited is written. These extended lexemes are defined similar to lexemes that might be used in a batch lexer, but are more numerous as the present editor must account for the incomplete and ill-formed lexemes that arise as the user types the program. Before performing lexical analysis, the present editor separates program statements from program comments. The editor then stores the text of the comments along with comment positioning information that allows the original position of the comments as entered by the user to be recreated for printing or display purposes. Based on the token stream and the separately represented comments, the editor prettyprints the program and comments as the user types. The editor also allows the user to edit the program from the prettyprinted display as if the program were internally represented as text. The present editor also allows the user to periodically request a syntactical analysis of the program, wherein the structure of the program is represented in a syntax tree that references the token stream.

Token-based computer program editor with program comment management

A system and method for integrating versioning and editing of data repositories is disclosed. A data repository consists of a number of packages, each having at least one package version that includes at least one component. A version handler is uniquely associated with a package version being edited and monitors all versioning commands associated with that package version. A component handler is uniquely associated with a component being edited or a component in an editing chain. When associated with a component being edited, a component handler forms the exclusive interface between that component and the editor and monitors all editing actions taken with respect to its associated component. Other component handlers act as communications links between their child component handler and one parent handler (e.g., a top-level component handler is coupled to the version handler associated with the same package). By monitoring all editing actions, the present system is able to respond to versioning commands issued by a user in a coordinated manner so as to rigorously maintain configuration management. For example, in response to a user issuing an advance command, the present system constructs a new package version including components modified since the last advance and sharing components with back versions, which are retained intact. To support this coordination, the handlers are implemented as objects that encapsulate handler routines and abstract interfaces. Interfaces between a component handler and the editor opened on the component handler's component are customizable so that any editor can be used with the present system.

System and method for integrating editing and versioning in data

A method and lexical analyzer for diagnosing lexical errors in a stream of symbols. An error-diagnosing lexical analyzer is constructed by a lexical analyzer generator based on a list of regular expression patterns. The list of regular expression patterns includes patterns which define specific invalid lexeme types as well as specific valid lexeme types. The lexical analyzer generated based on the list of regular expression patterns has a first plurality of states and a second plurality of states. Each state of the first plurality of states represents a specific valid lexeme type and is associated with a label identifying the specific valid lexeme type. Each state of the second plurality of states represents a specific invalid lexeme type and is associated with a label identifying the specific invalid lexeme type. The lexical analyzer reads symbols from a stream of symbols and changes state based on the symbols according to transition rules. When the lexical analyzer reads a terminating character, the lexical analyzer transmits a signal indicating the lexeme type associated with the state of the lexical analyzer at the time the terminating symbol was encountered. The lexeme type indicated in the signal is used to characterize the series of symbols processed prior to encountering the terminating symbol.

Method and apparatus for diagnosing lexical errors

A user-friendly editor for structurally represented computer programs is disclosed. The present editor combines advantages of text editors and structure editors by transforming, as the user types, the text stream entered by the user into a token stream, where the tokens of the token stream constitute the words of the program being entered. Each of the tokens is classified by the editor as one of group of extended lexemes defined by the language in which the program being edited is written. These extended lexemes are defined similarly to lexemes that might be used in a batch lexer, but are more numerous as the present editor must account for the incomplete and ill-formed lexemes that arise as the user types the program. Based on information in the token stream, the editor prettyprints the program as the user types. This prettyprinting step involves typesetting each of the tokens in a visually distinct manner and displaying a varying amount of visual whitespace between the tokens, each of these operations being based on the lexical types of the tokens. The editor also allows the user to edit the program from the prettyprinted display as if the program were internally represented as text via a cursor whose position and appearance depends on the lexical types of tokens adjacent to the cursor. The present editor also allows the user to periodically request a syntactical analysis of the program, wherein the structure of the program is represented in a syntax tree that references the token stream.

System and method for inter-token whitespace representation and textual

A user-friendly editor for structurally represented computer programs is disclosed. The present editor combines advantages of text editors and structure editors by transforming, as the user types, the event stream entered by the user into a token stream, where the tokens of the token stream constitute the words of the program being entered. Each of the tokens is classified by the editor as one of group of extended lexemes defined by the language in which the program being edited is written. These extended lexemes are defined similar to lexemes that might be used in a batch lexer, but are more numerous as the present editor must account for the incomplete and ill-formed lexemes that arise as the user types the program. Based on information in the token stream, the editor prettyprints the program as the user types. The editor also allows the user to edit the program from the prettyprinted display as if the program were internally represented as text. The present editor also allows the user to periodically request a syntactical analysis of the program, wherein the structure of the program is represented in a syntax tree that references the token stream.

System and method for textual editing of structurally-represented

A system and method are disclosed that enable a batch lexer to be used to incrementally update a token stream representation of a computer program maintained in an editor as the computer program is being edited. A keystroke executive interprets editing inputs and dispatches editing events to a lexical analyzer. The lexical analyzer converts a range of the tokens likely to be affected to an equivalent old textual stream that preserves whitespace implied by but not represented within the token stream. A new text stream is generated from the old text stream by carrying out the current editing event. I.e., insertion of text is handled by the insertion of the relevant text into the old text stream (now the new stream) and deletion of a character is handled by deleting the appropriate character from the old text stream. The batch lexer is then invoked on the new text stream and as a result returns a new token stream. The fewest possible tokens from the new token stream that reflect the entire impact of the current editing event are returned to the keystroke executive along with an updated editing point within the new token stream as the suggested token stream update. The keystroke executive is free to ignore or accept the suggested update. The new token stream and the new text stream can be generated lazily, respectively one token and one character at a time.

Growing community of inventors

Mountain View, CA, United States of America

Michael L Van De Vanter