Abstract: Efficient immutable syntax representation with parent pointers under incremental change is enabled by creating a data structure comprising at least one tree structure that allows both upward and downward references in the tree and a tree structure that is immutable (read-only), and allows parts of itself to be re-used in other data structures. The data structure described enables tools to search and target particular sub trees. The fragment of the tree representing the targeted sub tree is produced as it is used. The rest of the tree is not produced. The read-only tree retains relative information, allowing it to be reassembled and shared.

Abstract: Efficient immutable syntax representation with parent pointers under incremental change is enabled by creating a data structure comprising at least one tree structure that allows both upward and downward references in the tree and a tree structure that is immutable (read-only), and allows parts of itself to be re-used in other data structures. The data structure described enables tools to search and target particular sub trees. The fragment of the tree representing the targeted sub tree is produced as it is used. The rest of the tree is not produced. The read-only tree retains relative information, allowing it to be reassembled and shared.

Abstract: Efficient immutable syntax representation with parent pointers under incremental change is enabled by creating a data structure comprising at least one tree structure that allows both upward and downward references in the tree and a tree structure that is immutable (read-only), and allows parts of itself to be re-used in other data structures. The data structure described enables tools to search and target particular sub trees. The fragment of the tree representing the targeted sub tree is produced as it is used. The rest of the tree is not produced. The read-only tree retains relative information, allowing it to be reassembled and shared.

Abstract: The present invention refers to a set of methods and procedures that may be combined in order to greatly increase the speed of development of an access ramp in a underground hard-rock mine. More particularly, the present invention was designed to target all the bottle-necks comprised by the access operation of a hard-rock mine that employs a RAIL-VEYOR machine. The invention also comprises of an ore production line which consists in the sequential arrangement of a series of mining equipment between the work face and the entrance of a hard-rock mine. The invention also comprises a Hard Rock Mining Access Plan for a hard-rock mine which encompasses two parallel ramps interconnected by cross-cut passageways. Further, invention also comprises a Ground Support Installation method configured to shorten the time required for the installation of ground support inside of a hard-rock mine.

Abstract: The present invention refers to a set of methods and procedures that may be combined in order to greatly increase the speed of development of an access ramp in a underground hard-rock mine. More particularly, the present invention was designed to target all the bottle-necks comprised by the access operation of a hard-rock mine that employs a Rail-Veyor machine. The invention also comprises of an ore production line which consists in the sequential arrangement of a series of mining equipment between the work face and the entrance of a hard-rock mine. The invention also comprises a Hard Rock Mining Access Plan for a hard-rock mine which encompasses two parallel ramps interconnected by cross-cut passageways. Further, invention also comprises a Ground Support Installation method configured to shorten the time required for the installation of ground support inside of a hard-rock mine.

Abstract: An augmented parser can create an augmented parse tree that captures all the information in the source code as additional elements. Information included in the augmented parse tree can include whitespace, comments, pre-processor directives, line continuation characters, missing text, text errors, and original text. Thus, the augmented parse tree can be used to fully reconstruct the original source code, character for character, including spaces, comments, and incorrect code. The improved parser can store syntactic error information in the original source code in the parse tree. The augmented parse tree can be used to generate or modify source code. The parse tree created by the augmented parser can be used for incremental parsing to create a new augmented parse tree after a change.

Abstract: Efficient immutable syntax representation with parent pointers under incremental change is enabled by creating a data structure comprising at least one tree structure that allows both upward and downward references in the tree and a tree structure that is immutable (read-only), and allows parts of itself to be re-used in other data structures. The data structure described enables tools to search and target particular sub trees. The fragment of the tree representing the targeted sub tree is produced as it is used. The rest of the tree is not produced. The read-only tree retains relative information, allowing it to be reassembled and shared.

Abstract: Performing validation of a derived virtual method includes receiving program code where the derived virtual method is derived from a virtual method of the program language used to generate the program code, compiling the program code to an intermediate language expression, generating metadata descriptive of the compiled program code, validating the use of the derived virtual method by accessing the metadata, and permitting the use of the derived virtual method if the metadata grants override permissions concerning the virtual method of the programming language. The metadata indicating access and override permissions may be generated while compiling the program code in the common language infrastructure. Alternately, the flag may use pre-existing values indicative of the access and override permissions concerning the virtual method of the programming language.