(19)
(11)EP 3 422 181 B1

(12)EUROPEAN PATENT SPECIFICATION

(45)Mention of the grant of the patent:
23.09.2020 Bulletin 2020/39

(21)Application number: 17773075.1

(22)Date of filing:  20.03.2017
(51)International Patent Classification (IPC): 
G06F 9/44(2018.01)
G06F 8/33(2018.01)
(86)International application number:
PCT/CN2017/077252
(87)International publication number:
WO 2017/167045 (05.10.2017 Gazette  2017/40)

(54)

METHOD AND DEVICE FOR GENERATING CODE ASSISTANCE INFORMATION

VERFAHREN UND VORRICHTUNG ZUR ERZEUGUNG VON CODEASSISTENZINFORMATIONEN

PROCÉDÉ ET DISPOSITIF DE GÉNÉRATION D'INFORMATIONS D'ASSISTANCE DE CODE


(84)Designated Contracting States:
AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

(30)Priority: 28.03.2016 CN 201610183039

(43)Date of publication of application:
02.01.2019 Bulletin 2019/01

(73)Proprietor: Alibaba Group Holding Limited
Grand Cayman (KY)

(72)Inventors:
  • XUE, Ming
    Hangzhou Zhejiang 311121 (CN)
  • WU, Jinpeng
    Hangzhou Zhejiang 311121 (CN)
  • HOU, Zhenyu
    Hangzhou Zhejiang 311121 (CN)

(74)Representative: Branderhorst, Matthijs Pieter Arie 
Marks & Clerk LLP Fletcher House Heatley Road The Oxford Science Park
Oxford OX4 4GE
Oxford OX4 4GE (GB)


(56)References cited: : 
CN-A- 102 591 470
CN-A- 103 294 468
US-A1- 2004 261 059
CN-A- 102 880 468
CN-A- 104 050 183
  
  • MICHAEL WÜRSCH ET AL: "Supporting developers with natural language queries", SOFTWARE ENGINEERING, 2010 ACM/IEEE 32ND INTERNATIONAL CONFERENCE ON, IEEE, 2 PENN PLAZA, SUITE 701 NEW YORK NY 10121-0701 USA, 1 May 2010 (2010-05-01), pages 165-174, XP058199242, DOI: 10.1145/1806799.1806827 ISBN: 978-1-60558-719-6
  • CÁNOVAS IZQUIERDO JAVIER LUIS ET AL: "Extracting models from source code in software modernization", SOFTWARE & SYSTEMS MODELING, SPRINGER BERLIN HEIDELBERG, BERLIN/HEIDELBERG, vol. 13, no. 2, 9 September 2012 (2012-09-09), pages 713-734, XP035315632, ISSN: 1619-1366, DOI: 10.1007/S10270-012-0270-Z [retrieved on 2012-09-09]
  
Note: Within nine months from the publication of the mention of the grant of the European patent, any person may give notice to the European Patent Office of opposition to the European patent granted. Notice of opposition shall be filed in a written reasoned statement. It shall not be deemed to have been filed until the opposition fee has been paid. (Art. 99(1) European Patent Convention).


Description

TECHNICAL FIELD



[0001] The present disclosure relates to the field of information technologies, and in particular, to a method and a device for generating code assistance information.

BACKGROUND



[0002] Recently, the integrated development environment (IDE) has become a mainstream tool for program design and development. As the complexity of program design languages continues to increase, a code assistance function is more widely applied in the IDE. A program developer may perform a subsequent input according to code assistance information. The code assistance function can reduce a load of a program developer for memorizing a syntax rule and names of language elements, reduce a quantity of characters entered by the program developer and an error rate, and improve the program development efficiency.

[0003] Currently, during code assistance, first, names of all language elements are used as code assistance information and displayed to the program developer, and then, code assistance information filtering is performed according to contents constantly entered by the program developer. However, most information in the code assistance information is not needed by the program developer. For example, in the structured query language (SQL), the program developer enters an INSERT statement, and a schematic diagram of a display interface of existing code assistance information is shown in FIG. 5, and when the program developer continues to enter "in", a schematic diagram of a display interface of existing code assistance information obtained after filtering is shown in FIG. 6. Information in FIG. 5 and FIG. 6 is not needed by the program developer, and the program developer hardly chooses the information during an actual development process. Displaying of the information may cause interference to the program developer, leading to low precision of generated code assistance information. In addition, displaying of the unnecessary code assistance information may cause a waste of system resources.

[0004] Würsch et. Al. in "Supporting Developers with Natural Language Queries", 2010 ACM/IEE 32nd International Conference on Software Engineering, IEEE, 2 Penn Plaza, Suite 701, New York, NY, 10121-0701, 1 May 2010, pages 165-0174, describe a framework to query for information about a software system using guided-input natural language resembling plain English. For that, the authors model data extracted by classical software analysis tools with an OWL ontology and use knowledge processing technologies from the Semantic Web to query it.

[0005] Cánovas et. Al, in "Extracting Models from Source Code in Software Modernization" state that the extraction of models from GPL code is an essential task in a model-based modernization Process and that this activity could be performed by tools to bridge grammarware and MDD technical spaces, which is normally carried out by dedicated parsers.

SUMMARY



[0006] In view of this, embodiments of the present disclosure provide a method and a device for generating code assistance information, to resolve the technical problem of low precision for generated code assistance information.

[0007] In addition, the embodiments of the present disclosure further provide a method and a device for generating code assistance information, to resolve the problem that because displayed code assistance information includes a large amount of useless information, a waste of system resources is caused when the code assistance information is displayed.

[0008] To achieve the foregoing objective, the following technical solutions are provided in the present disclosure.
Various aspects of the present invention are defined in the independent claims. Some preferred features are defined in the dependent claims.

[0009] Described herein for information is a method for displaying code assistance information, including:

receiving input status information obtained through an operation interface during a current program development process, where the input status information includes input content information and input language environment information;

obtaining a preset grammar rule corresponding to the input status information, where the preset grammar rule stores an association relationship between different statement information, and different input status information corresponds to different preset grammar rules; and

generating and outputting code assistance information corresponding to the input content information according to the input content information and the preset grammar rule corresponding to the input status information.



[0010] Described herein for information is a device for displaying code assistance information, including:
an obtaining unit, configured to obtain input status information corresponding to a current program development process, where the input status information includes input content information and input language environment information, where:

the obtaining unit is further configured to obtain a preset grammar rule corresponding to the input status information, where the preset grammar rule stores an association relationship between different statement information, and different input status information corresponds to different preset grammar rules; and

a generation unit, configured to generate code assistance information corresponding to the input content information according to the input content information and the preset grammar rule corresponding to the input status information.



[0011] By using the foregoing technical solutions, the technical solutions provided in the embodiments of the present disclosure have at least the following advantages:
The embodiments of the present disclosure provide a method and a device for generating code assistance information. First, the input status information corresponding to the current program development process is obtained, and the input status information includes the input content information and the input language environment information. The preset grammar rule corresponding to the input status information is obtained, the preset grammar rule stores the association relationship between different statement information, and different input status information corresponds to different preset grammar rules. The code assistance information corresponding to the input content information is generated according to the input content information and the preset grammar rule corresponding to the input status information. Compared with a current method that first, names of all language elements are used as code assistance information and displayed to a program developer, and code assistance information filtering is performed according to contents constantly entered by the program developer, in the embodiments of the present disclosure, the code assistance information corresponding to the input content information is generated according to the input content information and the preset grammar rule corresponding to the input status information, so that the precision of the code assistance information can be improved, and the waste of system resources caused by the large amount of useless information in the code assistance information can be avoided.

[0012] The foregoing descriptions are merely a summary of the technical solutions of the present disclosure. To better understand the technical features of the present disclosure, implement the technical means according to the content of the specification, and make the foregoing and other objectives, features, and advantages more comprehensive, detailed implementations of the present disclosure are described below.

BRIEF DESCRIPTION OF THE DRAWINGS



[0013] By reading detailed descriptions of the following preferable implementations, other various advantages and benefits become clear to a person of ordinary skill in the art. The accompanying drawings are merely used to show the objective of the preferable implementations, but are not considered as a limitation to the present disclosure. In addition, in the entire accompanying drawings, same reference numerals represent the same components. In the accompanying drawings:

FIG. 1 is a flowchart of a method for generating code assistance information according to an embodiment of the present disclosure;

FIG. 2 is a flowchart of another method for generating code assistance information according to an embodiment of the present disclosure;

FIG. 3 is a schematic structural diagram of a device for generating code assistance information according to an embodiment of the present disclosure;

FIG. 4 is a schematic structural diagram of another device for generating code assistance information according to an embodiment of the present disclosure;

FIG. 5 is a schematic diagram of a display interface of existing code assistance information;

FIG. 6 is a schematic diagram of a display interface of existing filtered code assistance information;

FIG. 7 is a schematic diagram of a display interface of code assistance information according to an embodiment of the present disclosure; and

FIG. 8 is a flowchart of a code assistance method during a program development process according to an embodiment of the present disclosure.


DETAILED DESCRIPTION



[0014] The following describes in detail exemplary embodiments of the present disclosure with reference to the accompanying drawings. Although the accompanying drawings show exemplary embodiments of the present disclosure, it should be understood that the present disclosure may be implemented in various forms, and should not be limited by the described embodiments. To the contrary, the embodiments are provided, so that the present disclosure can be better understood, and the scope of the present disclosure can be completely conveyed to a person skilled in the art.

[0015] An embodiment of the present disclosure provides a method for generating code assistance information. As shown in FIG. 1, the method includes the following steps.

[0016] 101. Obtain input status information corresponding to a current program development process.

[0017] The input status information includes input content information and input language environment information. The input content information may include input statement information and cursor location information. For example, the input statement information is INSERT. The input language environment information may be a program design language used during a program development process, for example, a SQL, or a C language. The program design language is generally defined by a context-free grammar. The context-free grammar is a transform grammar, used to describe a context-free language. For example, particular statement information in the program design language or whether statement information occurs in a particular location does not depend on a context.

[0018] In the embodiments of the present disclosure, a user usually enters statement information in a text editor corresponding to the IDE, to perform program development. Therefore, the input status information corresponding to the program development process is input status information obtained by using the text editor. Step 101 may be for example: obtaining the input status information in the text editor corresponding to the current IDE.

[0019] 102. Obtain a preset grammar rule corresponding to the input status information.

[0020] The preset grammar rule stores an association relationship between different statement information, and different input status information corresponds to different preset grammar rules. The preset grammar rule may be a context-free grammar rule.

[0021] Different languages of the same statement information correspond to different context-free grammar rules. For example, statement information is an assignment statement, and the assignment statement corresponds to different context-free grammar rules in the Java language and the C language. Different statement information of the same Language corresponds to different context-free grammar rules. For example, an INSERT language corresponds to a context-free grammar rule in the SQL language, but corresponds to no context-free grammar rule in the C language. Therefore, different input status information corresponds to different context-free grammar rules during the program development process.

[0022] 103. Generate code assistance information corresponding to the input content information according to the input content information and the preset grammar rule corresponding to the input status information.

[0023] The code assistance information corresponding to the input content information may be code assistance information related to the input content information. The code assistance information is used to prompt content that is to be subsequently entered by the user. By using the code assistance information, a code writing speed can be increased, and spelling and syntax errors can be reduced, thereby improving the program development efficiency.

[0024] In the embodiments of the present disclosure, content information related to the input content information may be specifically deduced according to the association relationship between different statement information stored in the preset grammar rule and the input content information, and then, the content information related to the input content information is determined as the code assistance information related to the input content information.

[0025] For example, a current input language environment is the SQL language, and current input content information is "INSERT". Then, content information related to "INSERT", for example, "INSERT OVERWRITE DIRECTORY" or "INSERT OVERWRITE LOCAL DIRECTORY", is generated according to a context-free grammar rule of INSERT in the SQL language, and then, the content information related to "INSERT" is determined as the code assistance information corresponding to "INSERT". The context-free grammar rule of INSERT in the SQL language stores an association relationship between "INSERT" and each statement information such as "INSERT OVERWRITE DIRECTORY" or "INSERT OVERWRITE LOCAL DIRECTORY".

[0026] In the embodiments of the present disclosure, the content information related to the input content information is generated according to the input content information and the preset grammar rule corresponding to the input status information, and then, the content information related to the input content information is determined as the code assistance information corresponding to the input content information, so that the precision of displaying the code assistance information can be improved, and the waste of system resources caused by the large amount of useless information in the code assistance information can be avoided.

[0027] In the method for generating code assistance information in the embodiments of the present disclosure, first, the input status information corresponding to the current program development process is obtained, and the input status information includes the input content information and the input language environment information. The preset grammar rule corresponding to the input status information is obtained, the preset grammar rule stores the association relationship between different statement information, and different input status information corresponds to different preset grammar rules. The code assistance information corresponding to the input content information is generated according to the preset grammar rule corresponding to the input status information. Compared with a current method that names of all language elements are used as code assistance information and displayed to a program developer, and code assistance information filtering is performed according to contents constantly entered by the program developer, in the embodiments of the present disclosure, the code assistance information corresponding to the input content information is generated according to the input content information and the preset grammar rule corresponding to the input status information, so that the precision of the code assistance information can be improved, and the waste of system resources caused by the large amount of useless information in the code assistance information can be avoided.

[0028] An embodiment of the present disclosure provides another method for generating code assistance information. As shown in FIG. 2, the method includes the following steps.

[0029] 201. Obtain input status information corresponding to a current program development process.

[0030] The input status information includes input content information and input language environment information. For corresponding descriptions of the input content information and the input language environment information, refer to the corresponding descriptions in the embodiment of FIG. 1, and details are not described herein again.

[0031] 202. Detect whether the input content information includes preset information.

[0032] The preset information may be special separation character information, for example, ", ", and "(", or may be a trigger character, and this is not limited herein.

[0033] 203. If the input content information includes the preset information, obtain the preset grammar rule corresponding to the input status information.

[0034] The preset grammar rule stores an association relationship between different statement information, and different input status information corresponds to different preset grammar rules. The preset grammar rule may be a context-free grammar rule. For corresponding descriptions of the context-free grammar rule, refer to the corresponding descriptions in the embodiment of FIG. 1, and details are not described herein again.

[0035] 204. Obtain a finite state machine corresponding to the preset grammar rule.

[0036] The finite state machine stores a transform rule between different statement information. The finite state machine is a mathematical model representing a finite quantity of states and behaviors of transform and acting between the states.

[0037] In the embodiments of the present disclosure, before step 204, the method may further include: parsing and transforming the preset grammar rule into the finite state machine. For example, a grammar rule recognizer may parse and transform the preset grammar rule into the finite state machine. The grammar rule recognizer may be for example an open source syntax analyzer (ANTLR-Another Tool for Language Recognition, Antlr), a Yet Another Compiler Compiler (Yacc), or the like.

[0038] 205. Generate a follow-up symbol set corresponding to subsequent input content information corresponding to the input content information according to the input content information and the transform rule between different statement information in the finite state machine.

[0039] The follow-up symbol set includes a grammar production set of the transform rule, a non-terminator set corresponding to the grammar production set, and an initial terminator set corresponding to the grammar production set. The subsequent input content information may be content information related to the input content information.

[0040] In the embodiments of the present disclosure, step 205 may be for example: first, parsing and transforming the input content information into input content information in the finite state machine, which may be for example: parsing and transforming, by using the syntax parser, the input content information into the input content information in the finite state machine; and then, generating, by using a state transition analyzer, the follow-up symbol set corresponding to the subsequent input content information corresponding to the input content information according to the input content information in the finite state machine and the transform rule in the finite state machine.

[0041] In the embodiments of the present disclosure, for the convenience of descriptions, the input content information in the finite state machine is marked as S, the follow-up symbol set is marked as Follow(S), the grammar production set of the transform rule is marked as Rule(S), the non-terminator set corresponding to the grammar production is marked as N(S), and the initial terminator set corresponding to the grammar production is marked as E(S).

[0042] For example, the input content information of the user in the SQL development environment is "INSERT[I]", of which [I] represents a current cursor location. The input content information is parsed and transformed into the input content information "INSERT" in the finite state machine, and Follow(S) = {N(S), E(S), Rule(S)} may be generated according to "INSERT" and the transform rule between different statement information in the finite state machine.
N (S) = {insertClause}
E(S) = {INSERT}
Rule (S) = {{KW_INSERT KW_OVERWRITE destination ifNotExists?}, {KW_INSERT KW_INTO KW_TABLE? tableOrPartition (LPAREN columnNameList RPAREN)?}}

[0043] 206. Associate a grammar expansion corresponding to a non-terminator in the non-terminator set with a grammar expansion of an initial terminator in the initial terminator set.

[0044] The grammar expansion corresponding to the non-terminator is a result representing that a grammar production corresponding to the non-terminator is expanded into a terminator sequence.

[0045] In the embodiments of the present disclosure, step 206 may be for example: when the grammar expansion corresponding to the non-terminator is equal to the grammar expansion of the initial terminator, determining the grammar expansion of the initial terminator as assistance candidate information of the subsequent input content information.

[0046] It should be noted that before step 206, the method may further include: obtaining a grammar production corresponding to the non-terminator and corresponding to the initial terminator in the initial terminator set; and determining, as the grammar expansion corresponding to the non-terminator, a result obtained after all non-terminators in the grammar production are cyclically expanded until the all non-terminators are eliminated.

[0047] The grammar expansion corresponding to the non-terminator is marked as Template(N) herein. To describe a process of obtaining Template(N), an example is provided herein according to INSERT. As shown in the following, insertClause is a non-terminator, and grammar productions corresponding to insertClause are rulel and rule2.
insertClause: rulellrule2;
rulel = {KW_INSERT KW_OVERWRITE destination ifNotExists?};
rule2 = {KW_INSERT KW_INTO KW_TABLE? tableOrPartition (LPAREN columnNameList RPAREN)?};
A non-terminator in rulel is destination, and because grammar productions corresponding to destination in the SQL language are rule3 and rule4:
destination: rule3lrule4;
rule3 = {(KW_LOCAL)? KW_DIRECTORY StringLiteral tableRowFormat? tableFileFormat?};
rule4 = {KW_TABLE tableOrPartition};
Definitions of grammar productions such as ifNotExists, StringLiteral, tableRowFormat, and tableFileFormat are not described in detail, but this does not affect the process of generating Template (N).

[0048] The initial terminator First set of a non-terminator destination={ DIRECTORY, LOCAL DIRECTORY, TABLE};
grammar productions corresponding to initial terminators DIRECTORY and LOCAL DIRECTORY in the First set of the non-terminator destination are both rule3, and the non-terminators are expanded into DIRECTORY and LOCAL DIRECTORY,
a grammar production of an initial terminator TABLE in the First set of the non-terminator destination is rule4, and the non-terminator is expanded into TABLE;
the First set of the non-terminator insertClause={INSERT};
because an initial terminator in the First set corresponding to the non-terminator insertClause is INSERT and is equal to E(S), grammar productions corresponding to INSERT are rulel and rule2,
a result obtained after the non-terminator destination in rulel is cyclically expanded until all non-terminators are eliminated is:

template1 = INSERT OVERWRITE DIRECTORY

template2 = INSERT OVERWRITE LOCAL DIRECTORY

template3 = INSERT OVERWRITE TABLE



[0049] A result obtained after the non-terminator destination in rule2 is cyclically expanded until all non-terminators are eliminated is:

tempalte4 = INSERT INTO

template5 = INSERT INTO TABLE

therefore, the following obtained grammar expansions are assistance candidate information of the subsequent input content information:

template 1 = INSERT OVERWRITE DIRECTORY

template2 = INSERT OVERWRITE LOCAL DIRECTORY

template3 = INSERT OVERWRITE TABLE

tempalte4 = INSERT INTO

template5 = INSERT INTO TABLE.



[0050] 207. Generate the code assistance information corresponding to the input content information according to an association result.

[0051] In the embodiments of the present disclosure, step 207 may be for example: determining the initial terminator and the assistance candidate information as the code assistance information corresponding to the input content information.

[0052] Further, before the determining the initial terminator and the assistance candidate information as the code assistance information corresponding to the input content information, the method may further include: obtaining historical input status information corresponding to the input status information, and sorting the initial terminator and the assistance candidate information according to the historical input status information. For example, the assistance candidate information and the initial terminator may be sorted according to quantities of times that the assistance candidate information and the initial terminator occurs in the historical input status information or priorities of the assistance candidate information and the initial terminator, and this is not limited herein.

[0053] For example, the obtained assistance candidate information is:

template 1 = INSERT OVERWRITE DIRECTORY

template2 = INSERT OVERWRITE LOCAL DIRECTORY

template3 = INSERT OVERWRITE TABLE

tempalte4 = INSERT INTO

template5 = INSERT INTO TABLE.



[0054] The assistance candidate information and the initial terminator INSERT may be sorted, and a sequence obtained after sorting is:

INSERT

INSERT INTO

INSERT INTO TABLE

INSERT INTO OVERWRITE TABLE

INSERT INTO OVERWRITE DIRECTORY

INSERT INTO OVERWRITE LOCAL DIRECTORY



[0055] For example, it is code assistance information corresponding to INSERT.

[0056] 208. Output the code assistance information corresponding to the input content information.

[0057] In the embodiments of the present disclosure, step 208 may be for example: sending the code assistance information corresponding to the input content information to a text editor corresponding to a current IDE, and the text editor displays the code assistance information corresponding to the input content information.

[0058] For example, code assistance information corresponding to "INSERT" is as follows:

INSERT

INSERT INTO

INSERT INTO TABLE

INSERT INTO OVERWRITE TABLE

INSERT INTO OVERWRITE DIRECTORY

INSERT INTO OVERWRITE LOCAL DIRECTORY



[0059] A schematic diagram of a display interface of the code assistance information is shown in FIG. 7. The display interface of the code assistance information may be a display interface of the text editor.

[0060] In the embodiments of the present disclosure, after step 208, the method may further include: receiving an information choosing instruction corresponding to the code assistance information, where the information choosing instruction is used to instruct to choose information from the code assistance information; and updating the input content information according to the information.

[0061] For example, if information chosen by a program developer according to the information choosing instruction is INSERT INTO TABLE, the current input content information INSERT may be updated by using INSERT INTO TABLE.

[0062] Further, after the updating the input content information according to the information, the method may further include storing the information into the historical input status information. The information is stored into the historical input status information, so that subsequently, the initial terminator and the assistance candidate information can be sorted conveniently.

[0063] In the embodiments of the present disclosure, an exemplary application scenario may be shown as follows, but is not limited thereto. The exemplary application scenario includes a code assistance method in a program development process, as shown in FIG. 8.

[0064] Step 1. When the user enters the INSERT statement in a text editor corresponding to an SQL development environment, the device for generating code assistance information obtains the INSERT statement by using the text editor.

[0065] Step 2. The device for generating code assistance information recognizes, by using a grammar rule recognizer, a context-free grammar rule corresponding to the INSERT statement, and parses and transforms the context-free grammar rule corresponding to the INSERT statement into a finite state machine. The context-free grammar rule corresponding to the INSERT statement is shown in FIG. 7.

[0066] Step 3. The device for generating code assistance information generates a follow-up symbol set Follow(S) corresponding to subsequent input content information corresponding to the INSERT statement according to the input content information in the finite state machine and the transform rule in the finite state machine by using the state transition analyzer.

[0067] Step 4. The device for generating code assistance information obtains Follow(S).

[0068] Step 5. The device for generating code assistance information generates assistance candidate information of the subsequent input content information corresponding to the INSERT statement according to the INSERT statement and Follow(S), as shown in the following:

template 1 = INSERT OVERWRITE DIRECTORY

template2 = INSERT OVERWRITE LOCAL DIRECTORY

template3 = INSERT OVERWRITE TABLE

tempalte4 = INSERT INTO

template5 = INSERT INTO TABLE.



[0069] Step 6. The device for generating code assistance information sorts the assistance candidate information and the INSERT statement according to the historical input status information.

[0070] Step 7. The device for generating code assistance information determines the sorted assistance candidate information and INSERT statement as code assistance information corresponding to the INSERT statement.

[0071] Step 8. Output the code assistance information corresponding to the INSERT statement, as shown in FIG. 9.

[0072] Step 9. When the user chooses an INSERT INTO statement from the code assistance information shown in FIG. 9, obtain the INSERT INTO statement, and update the INSERT statement in the text editor by using the INSERT INTO statement.

[0073] Step 10. Store INSERT INTO statement into the historical input status information.

[0074] In the another method for generating code assistance information in the embodiments of the present disclosure, first, the input status information corresponding to the current program development process is obtained, and the input status information includes the input content information and the input language environment information. The preset grammar rule corresponding to the input status information is obtained, the preset grammar rule stores the association relationship between different statement information, and different input status information corresponds to different preset grammar rules. The code assistance information corresponding to the input content information is generated according to the preset grammar rule corresponding to the input status information. Compared with a current method that names of all language elements are used as code assistance information and displayed to a program developer, and code assistance information filtering is performed according to contents constantly entered by the program developer, in the embodiments of the present disclosure, the code assistance information corresponding to the input content information is generated according to the input content information and the preset grammar rule corresponding to the input status information, so that the precision of the code assistance information can be improved, and the waste of system resources caused by the large amount of useless information in the code assistance information includes can be avoided.

[0075] Further, in an exemplary implementation of the method shown in FIG. 1, an embodiment of the present disclosure provides a device for generating code assistance information. As shown in FIG. 3, the device may include an obtaining unit 31 and a generation unit 32.

[0076] The obtaining unit 31 is configured to obtain input status information corresponding to a current program development process, where the input status information includes input content information and input language environment information.

[0077] The obtaining unit 31 is further configured to obtain a preset grammar rule corresponding to the input status information, where the preset grammar rule stores an association relationship between different statement information, and different input status information corresponds to different preset grammar rules.

[0078] The generation unit 32 is configured to generate code assistance information corresponding to the input content information according to the preset grammar rule corresponding to the input status information.

[0079] It should be noted that the device embodiment corresponds to the method embodiment. For the convenience of reading, detailed content in the method embodiment is not described in the device embodiment again, but it should be clear that the device in this embodiment can correspond to all content in the method embodiment.

[0080] In the device for generating code assistance information in the embodiments of the present disclosure, first, the input status information corresponding to the current program development process is obtained, and the input status information includes the input content information and the input language environment information. The preset grammar rule corresponding to the input status information is obtained, the preset grammar rule stores the association relationship between different statement information, and different input status information corresponds to different preset grammar rules. The code assistance information corresponding to the input content information is generated according to the preset grammar rule corresponding to the input status information. Compared with a current method that names of all language elements are used as code assistance information and displayed to a program developer, and code assistance information filtering is performed according to contents constantly entered by the program developer, in the embodiments of the present disclosure, the code assistance information corresponding to the input content information is generated according to the preset grammar rule corresponding to the input status information, so that the precision of the code assistance information can be improved, and the waste of system resources caused by the large amount of useless information in the code assistance information can be avoided.

[0081] Further, in an exemplary implementation of the method shown in FIG. 2, an embodiment of the present disclosure provides another device for generating code assistance information. As shown in FIG. 4, the device may include an obtaining unit 41 and a generation unit 42.

[0082] The obtaining unit 41 is configured to obtain input status information corresponding to a current program development process, where the input status information includes input content information and input language environment information.

[0083] The obtaining unit 41 is further configured to obtain a preset grammar rule corresponding to the input status information, where the preset grammar rule stores an association relationship between different statement information, and different input status information corresponds to different preset grammar rules.

[0084] The generation unit 42 is configured to generate code assistance information corresponding to the input content information according to the input content information and the preset grammar rule corresponding to the input status information.

[0085] Further, the device further includes an output unit 43.

[0086] The output unit 43 is configured to output the code assistance information corresponding to the input content information.

[0087] Further, the device further includes a detection unit 44.

[0088] The detection unit 44 is configured to detect whether the input content information includes preset information, where the preset information is special separation character information.

[0089] The obtaining unit 41 is for example configured to: if the input content information includes the preset information, perform the obtaining a preset grammar rule corresponding to the input status information.

[0090] Further, the generation unit 41 includes an obtaining module, a generation module, an association module, and a generation module.

[0091] The obtaining module is configured to obtain a finite state machine corresponding to the preset grammar rule, where the finite state machine stores a transform rule between different statement information.

[0092] The generation module is configured to generate a follow-up symbol set corresponding to subsequent input content information corresponding to the input content information according to the input content information and the transform rule, where the follow-up symbol set includes a grammar production set of the transform rule, a non-terminator set corresponding to the grammar production, and an initial terminator set corresponding to the grammar production.

[0093] The association module is configured to associate a grammar expansion corresponding to a non-terminator in the non-terminator set with a grammar expansion of an initial terminator in the initial terminator set.

[0094] The generation module is configured to generate the code assistance information corresponding to the input content information according to an association result.

[0095] The association module is for example configured to: when the grammar expansion corresponding to the non-terminator is equal to the grammar expansion of the initial terminator, determine the grammar expansion of the initial terminator as assistance candidate information of the subsequent input content information.

[0096] The generation module is for example configured to determine the initial terminator and the assistance candidate information as the code assistance information corresponding to the input content information.

[0097] The generation unit 42 further includes a determining module.

[0098] The obtaining module is configured to obtain a grammar production corresponding to the non-terminator and corresponding to the initial terminator in the initial terminator set.

[0099] The determining module is configured to determine, as the grammar expansion corresponding to the non-terminator, a result obtained after all non-terminators in the grammar production are cyclically expanded until the all non-terminators are eliminated.

[0100] The obtaining module is further configured to obtain historical input status information corresponding to the input status information.

[0101] The sorting module is configured to sort the initial terminator and the assistance candidate information according to the historical input status information.

[0102] The determining module is for example configured to determine the sorted initial terminator and assistance candidate information as the code assistance information corresponding to the input content information.

[0103] Further, the device further includes a receiving unit 45 and an updating unit 46.

[0104] The receiving unit 45 is configured to receive an information choosing instruction corresponding to the code assistance information, where the information choosing instruction is used to instruct to choose information from the code assistance information.

[0105] The updating unit 46 is configured to update the input content information according to the information.

[0106] Further, the device further includes a storage unit 47.

[0107] The storage unit is configured to store the information into the historical input status information.

[0108] It should be noted that the device embodiment corresponds to the method embodiment. For the convenience of reading, detailed content in the method embodiment is not described in the device embodiment again, but it should be clear that the device in this embodiment can correspond to all content in the method embodiment.

[0109] In the another device for generating code assistance information in the embodiments of the present disclosure, first, the input status information corresponding to the current program development process is obtained, and the input status information includes the input content information and the input language environment information. The preset grammar rule corresponding to the input status information is obtained, the preset grammar rule stores the association relationship between different statement information, and different input status information corresponds to different preset grammar rules. The code assistance information corresponding to the input content information is generated according to the input content information and the preset grammar rule corresponding to the input status information. Compared with a current method that names of all language elements are used as code assistance information and displayed to a program developer, and code assistance information filtering is performed according to contents constantly entered by the program developer, in the embodiments of the present disclosure, the code assistance information corresponding to the input content information is generated according to the preset grammar rule corresponding to the input status information, so that the precision of the code assistance information can be improved, and the waste of system resources caused by the large amount of useless information in the code assistance information can be avoided.

[0110] A device for displaying the code assistance information includes a processor and a memory. The obtaining unit, the generation unit, the output unit, the detection unit, the updating unit, the storage unit, and the like are stored in the memory as program units. The processor executes the program units stored in the memory, to implement corresponding functions.

[0111] The processor includes a kernel, and the kernel invokes the corresponding program units in the memory. There may be one or more kernels. A problem of display stalling when a chosen picture in a table is displayed is resolved by adjusting a kernel parameter.

[0112] The memory may include a volatile memory, a random access memory (RAM), a non-volatile memory, and/or the like in a computer storage medium, for example, a read-only memory (ROM) or a flash memory (flash RAM). The memory includes at least one storage chip.

[0113] This application further provides a computer program product. When the computer program product is executed on a data processing device, the computer program product is configured to execute program code initialized with the following method steps:

[0114] obtaining input status information corresponding to a current program development process, where the input status information includes input content information and input language environment information;

[0115] obtaining a preset grammar rule corresponding to the input status information, where the preset grammar rule stores an association relationship between different statement information, and different input status information corresponds to different preset grammar rules; and

[0116] generating code assistance information corresponding to the input content information according to the input content information and the preset grammar rule corresponding to the input status information.

[0117] A person skilled in the art should understand that the embodiments of this application may be provided as a method, a system, or a computer program product. Therefore, this application may use an all hardware embodiment, an all software embodiment, or an embodiment combining software and hardware. In addition, this application may use a computer program product implemented on one or more computer available storage mediums (including, but not limited to, a magnetic memory, a CD-ROM, and an optical memory) including computer available program code.

[0118] This application is described with reference to a flowchart and/or block diagram of a method and device for displaying code assistance information and a computer program product in the embodiments of this application. It should be understood that computer program instructions can implement each process and/or block in the flowcharts and/or block diagrams and a combination of processes and/or blocks in the flowcharts and/or block diagrams. These computer program instructions may be provided to a general-purpose computer, a dedicated computer, an embedded processor, or a processor of another programmable data processing device to generate a machine, so that an apparatus configured to implement functions specified in one or more processes in the flowcharts and/or one or more blocks in the block diagrams is generated by using instructions executed by the general-purpose computer or the processor of another programmable data processing device.

[0119] These computer program instructions may also be stored in a computer-readable memory that can guide a computer or another programmable data processing device to work in a specific manner, so that the instructions stored in the computer-readable memory generate a product including an instruction apparatus, where the instruction apparatus implements functions specified in one or more processes in the flowcharts and/or one or more blocks in the block diagrams.

[0120] These computer program instructions may also be loaded into a computer or another programmable data processing device, so that a series of operation steps are performed on the computer or another programmable data processing device to generate processing implemented by a computer, and instructions executed on the computer or another programmable data processing device provide steps for implementing functions specified in one or more processes in the flowcharts and/or one or more blocks in the block diagrams.

[0121] In a typical configuration, a computing device includes one or more processors (CPUs), an input/output interface, a network interface, and a memory.

[0122] The memory may include a volatile memory, a RAM, a non-volatile memory, and/or the like in a computer storage medium, for example, a ROM or a flash memory (flash RAM). The memory is an example of a computer-readable medium.

[0123] The computer-readable medium includes a persistent and non-persistent, removable and non-removable medium, and can implement information storage by using any method or technology. Information may be a computer-readable instruction, a data structure, a program module, or other data. An example of a storage medium of a computer includes but is not limited to a phase change memory (PRAM), a static random access memory (SRAM), a dynamic random access memory (DRAM), another type of RAM, a ROM, an electrically erasable programmable read only memory (EEPROM), a flash memory or another memory technology, a compact disc read-only memory (CD-ROM), a digital versatile disc (DVD) or another optical storage, a cassette tape, magnetic tape/magnetic disk storage or any other non-transmission medium. The storage medium may be configured to store information accessible by the computing device. As defined in this specification, the computer-readable medium does not include a transitory computer-readable medium (transitory media), such as a modulated data signal and carrier.


Claims

1. A computer-implemented
method for generating code assistance information, comprising:

obtaining (101, 201) input status information corresponding to a current program development process, wherein the input status information comprises input content information and input language environment information;

obtaining (102, 203) a preset grammar rule corresponding to the input status information, wherein the preset grammar rule stores an association relationship between different statement information, and different input status information corresponds to different preset grammar rules;

obtaining a transform rule between different statement information based on the preset grammar rule;

generating (205) a follow-up symbol set corresponding to subsequent input content information corresponding to the input content information according to the input content information and the transform rule, wherein the follow-up symbol set comprises a grammar production set of the transform rule, a non-terminator set corresponding to the grammar production, and an initial terminator set corresponding to the grammar production;

associating (206) a grammar expansion corresponding to a non-terminator in the non-terminator set with a grammar expansion of an initial terminator in the initial terminator set; and

generating (103, 207) code assistance information corresponding to the input content information according to the associated result of the grammar expansion corresponding to the non-terminator with the grammar expansion of the initial terminator.


 
2. The method according to claim 1, wherein after the generating code assistance information corresponding to the input content information, the method further comprises:
Outputting (208) the code assistance information.
 
3. The method according to claim 1, wherein after the obtaining a preset grammar rule corresponding to the input status information, the method further comprises:

detecting whether the input content information comprises preset information, wherein the preset information is special separation character information; and

if the input content information comprises the preset information, performing the obtaining a preset grammar rule corresponding to the input status information.


 
4. The method according to claim 1, wherein the obtaining a transform rule between different statement information based on the preset grammar rule comprises:
obtaining a finite state machine corresponding to the preset grammar rule, wherein the finite state machine stores a transform rule between different statement information.
 
5. The method according to claim 1, wherein the associating a grammar expansion corresponding to a non-terminator in the non-terminator set with a grammar expansion of an initial terminator in the initial terminator set comprises:

when the grammar expansion corresponding to the non-terminator is equal to the grammar expansion of the initial terminator, determining the grammar expansion of the initial terminator as assistance candidate information of the subsequent input content information; and

the generating the code assistance information corresponding to the input content information according to an association result comprises:
determining the initial terminator and the assistance candidate information as the code assistance information corresponding to the input content information.


 
6. The method according to claim 1, wherein before the associating a grammar expansion corresponding to a non-terminator in the non-terminator set with a grammar expansion of an initial terminator in the initial terminator set, the method further comprises:

obtaining a grammar production corresponding to the non-terminator and corresponding to the initial terminator in the initial terminator set; and

determining, as the grammar expansion corresponding to the non-terminator, a result obtained after all non-terminators in the grammar production are cyclically expanded until the all non-terminators are eliminated.


 
7. The method according to claim 5, wherein before the determining the initial terminator and the assistance candidate information as the code assistance information corresponding to the input content information, the method further comprises:

obtaining historical input status information corresponding to the input status information; and

sorting the initial terminator and the assistance candidate information according to the historical input status information; and

the determining the initial terminator and the assistance candidate information as the code assistance information corresponding to the input content information comprises:
determining the sorted initial terminator and assistance candidate information as the code assistance information corresponding to the input content information.


 
8. The method according to claim 2, wherein after the outputting the code assistance information, the method further comprises:

receiving an information choosing instruction corresponding to the code assistance information, wherein the information choosing instruction is used to instruct to choose data from the code assistance information; and

updating the input content information according to the chosen data.


 
9. The method according to claim 8, wherein after the updating the input content information according to the chosen data, the method further comprises:
storing the chosen data into historical input status information.
 
10. A device for generating code assistance information, comprising:

an obtaining unit (31, 41), configured to:
obtain input status information corresponding to a current program development process, wherein the input status information comprises input content information and input language environment information, and obtain a preset grammar rule corresponding to the input status information, wherein the preset grammar rule stores an association relationship between different statement information, and different input status information corresponds to different preset grammar rules; and

a generation unit (32, 42), the generation unit comprising:

a generation module, configured to generate a follow-up symbol set corresponding to subsequent input content information corresponding to the input content information according to the input content information and the transform rule, wherein the follow-up symbol set comprises a grammar production set of the transform rule, a non-terminator set corresponding to the grammar production, and an initial terminator set corresponding to the grammar production;

an association module, configured to associate a grammar expansion corresponding to a non-terminator in the non-terminator set with a grammar expansion of an initial terminator in the initial terminator set; and

a generation module, configured to generate code assistance information corresponding to the input content information according to the associated result of the grammar expansion corresponding to the non-terminator with the grammar expansion of the initial terminator.


 
11. The device according to claim 10, wherein the device further comprises:
an output unit (43), configured to output the code assistance information, and, optionally, wherein the device further comprises:

a receiving unit (45), configured to receive an information choosing instruction corresponding to the code assistance information, wherein the information choosing instruction is used to instruct to choose data from the code assistance information; and

an updating unit (46), configured to update the input content information according to the chosen data, and, optionally, wherein the device further comprises a storage unit (47), configured to store the chosen data into historical input status information.


 
12. The device according to claim 10, wherein the device further comprises: a detection unit (44), wherein:

the detection unit is configured to detect whether the input content information comprises preset information, wherein the preset information is special separation character information; and

the obtaining unit is configured to: if the input content information comprises the preset information, perform the obtaining a preset grammar rule corresponding to the input status information.


 
13. The device according to claim 10, wherein the generation unit comprises:
an obtaining module, configured to obtain a finite state machine corresponding to the preset grammar rule, wherein the finite state machine stores a transform rule between different statement information.
 
14. The device according to claim 13, wherein:

the association module is configured to: when the grammar expansion corresponding to the non-terminator is equal to the grammar expansion of the initial terminator, determine the grammar expansion of the initial terminator as assistance candidate information of the subsequent input content information; and

the generation module is configured to determine the initial terminator and the assistance candidate information as the code assistance information corresponding to the input content information, and, optionally, wherein:

the obtaining module is further configured to obtain historical input status information corresponding to the input status information;

the sorting module is configured to sort the initial terminator and the assistance candidate information according to the historical input status information; and

the determining module is configured to determine the sorted initial terminator and assistance candidate information as the code assistance information corresponding to the input content information.


 
15. The device according to claim 13, wherein:

the generation unit further comprises a determining module;

the obtaining module is configured to obtain a grammar production corresponding to the non-terminator and corresponding to the initial terminator in the initial terminator set; and

the determining module is configured to determine, as the grammar expansion corresponding to the non-terminator, a result obtained after all non-terminators in the grammar production are cyclically expanded until the all non-terminators are eliminated.


 


Ansprüche

1. Computerimplementiertes Verfahren zum Erzeugen von Codeassistenzinformationen, umfassend:

Erlangen (101, 201) von Eingabestatusinformationen korrespondierend mit einem gegenwärtigen Programmentwicklungsprozess, wobei die Eingabestatusinformationen Eingabeinhaltsinformationen und Eingabesprachumgebungsinformationen umfassen;

Erlangen (102, 203) einer im Voraus eingestellten Grammatikregel korrespondierend mit den Eingabestatusinformationen, wobei die im Voraus eingestellte Grammatikregel ein Assoziationsverhältnis zwischen verschiedenen Aussageinformationen speichert und verschiedene Eingabestatusinformationen mit verschiedenen im Voraus eingestellten Grammatikregeln korrespondieren;

Erlangen einer Umwandlungsregel zwischen verschiedenen Aussageinformationen basierend auf der im Voraus eingestellten Grammatikregel;

Erzeugen (205) einer Folgesymbolmenge korrespondierend mit nachfolgenden Eingabeinhaltsinformationen korrespondierend mit den Eingabeinhaltsinformationen gemäß den Eingabeinhaltsinformationen und der Umwandlungsregel, wobei die Folgesymbolmenge eine Grammatikproduktionsmenge der Umwandlungsregel, eine Nichtabschlussmenge korrespondierend mit der Grammatikproduktion und eine anfängliche Abschlussmenge korrespondierend mit der Grammatikproduktion umfasst;

Assoziieren (206) einer Grammatikerweiterung korrespondierend mit einem Nichtabschluss in der Nichtabschlussmenge mit einer Grammatikerweiterung eines anfänglichen Abschlusses in der anfänglichen Abschlussmenge; und

Erzeugen (103, 207) von Codeassistenzinformationen korrespondierend mit den Eingabeinhaltsinformationen gemäß dem assoziierten Ergebnis der Grammatikerweiterung korrespondierend mit dem Nichtabschluss mit der Grammatikerweiterung des anfänglichen Abschlusses.


 
2. Verfahren nach Anspruch 1, wobei nach dem Erzeugen von Codeassistenzinformationen korrespondierend mit den Eingabeinhaltsinformationen das Verfahren ferner umfasst:
Ausgeben (208) der Codeassistenzinformationen.
 
3. Verfahren nach Anspruch 1, wobei nach dem Erlangen einer im Voraus eingestellten Grammatikregel korrespondierend mit den Eingabestatusinformationen das Verfahren ferner umfasst:

Detektieren, ob die Eingabeinhaltsinformationen im Voraus eingestellte Informationen umfassen, wobei die im Voraus eingestellten Informationen Informationen über spezielle Trennzeichen sind; und

wenn die Eingabeinhaltsinformationen die im Voraus eingestellten Informationen umfassen, Durchführen des Erlangens einer im Voraus eingestellten Grammatikregel korrespondierend mit den Eingabestatusinformationen.


 
4. Verfahren nach Anspruch 1, wobei das Erlangen einer Umwandlungsregel zwischen verschiedenen Aussageinformationen basierend auf der im Voraus eingestellten Grammatikregel umfasst:
Erlangen eines endlichen Automaten korrespondierend mit der im Voraus eingestellten Grammatikregel, wobei der endliche Automat eine Umwandlungsregel zwischen verschiedenen Aussageinformationen speichert.
 
5. Verfahren nach Anspruch 1, wobei das Assoziieren einer Grammatikerweiterung korrespondierend mit einem Nichtabschluss in der Nichtabschlussmenge mit einer Grammatikerweiterung eines anfänglichen Abschlusses in der anfänglichen Abschlussmenge umfasst:

wenn die Grammatikerweiterung korrespondierend mit dem Nichtabschluss gleich der Grammatikerweiterung des anfänglichen Abschlusses ist, Bestimmen der Grammatikerweiterung des anfänglichen Abschlusses als Assistenzkandidateninformationen der nachfolgenden Eingabeinhaltsinformationen; und

wobei das Erzeugen der Codeassistenzinformationen korrespondierend mit den Eingabeinhaltsinformationen gemäß einem Assoziationsergebnis umfasst:
Bestimmen des anfänglichen Abschlusses und der Assistenzkandidateninformationen als die Codeassistenzinformationen korrespondierend mit den Eingabeinhaltsinformationen.


 
6. Verfahren nach Anspruch 1, wobei vor dem Assoziieren einer Grammatikerweiterung korrespondierend mit einem Nichtabschluss in der Nichtabschlussmenge mit einer Grammatikerweiterung eines anfänglichen Abschlusses in der anfänglichen Abschlussmenge das Verfahren ferner umfasst:

Erlangen einer Grammatikproduktion korrespondierend mit dem Nichtabschluss und korrespondierend mit dem anfänglichen Abschluss in der anfänglichen Abschlussmenge; und

Bestimmen, als die Grammatikerweiterung korrespondierend mit dem Nichtabschluss, eines Ergebnisses, das erlangt wird, nachdem sämtliche Nichtabschlüsse in der Grammatikproduktion zyklisch erweitert werden, bis sämtliche Nichtabschlüsse eliminiert sind.


 
7. Verfahren nach Anspruch 5, wobei vor dem Bestimmen des anfänglichen Abschlusses und der Assistenzkandidateninformationen als die Codeassistenzinformationen korrespondierend mit den Eingabeinhaltsinformationen das Verfahren ferner umfasst:

Erlangen historischer Eingabestatusinformationen korrespondierend mit den Eingabestatusinformationen; und

Sortieren des anfänglichen Abschlusses und der Assistenzkandidateninformationen gemäß den historischen Eingabestatusinformationen; und

wobei das Bestimmen des anfänglichen Abschlusses und der Assistenzkandidateninformationen als die Codeassistenzinformationen korrespondierend mit den Eingabeinhaltsinformationen umfasst:
Bestimmen des sortierten anfänglichen Abschlusses und der sortierten Assistenzkandidateninformationen als die Codeassistenzinformationen korrespondierend mit den Eingabeinhaltsinformationen.


 
8. Verfahren nach Anspruch 2, wobei nach dem Ausgeben der Codeassistenzinformationen das Verfahren ferner umfasst:

Empfangen einer Informationsauswahlanweisung korrespondierend mit den Codeassistenzinformationen, wobei die Informationsauswahlanweisung verwendet wird, anzuweisen, Daten aus den Codeassistenzinformationen auszuwählen; und

Aktualisieren der Eingabeinhaltsinformationen gemäß den ausgewählten Daten.


 
9. Verfahren nach Anspruch 8, wobei nach dem Aktualisieren der Eingabeinhaltsinformationen gemäß den ausgewählten Daten das Verfahren ferner umfasst:
Speichern der ausgewählten Daten in historische Eingabestatusinformationen.
 
10. Vorrichtung zum Erzeugen von Codeassistenzinformationen, umfassend:
eine Erlangungseinheit (31, 41), konfiguriert zum:

Erlangen von Eingabestatusinformationen korrespondierend mit einem gegenwärtigen Programmentwicklungsprozess, wobei die Eingabestatusinformationen Eingabeinhaltsinformationen und Eingabesprachumgebungsinformationen umfassen, und Erlangen einer im Voraus eingestellten Grammatikregel korrespondierend mit den Eingabestatusinformationen, wobei die im Voraus eingestellte Grammatikregel ein Assoziationsverhältnis zwischen verschiedenen Aussageinformationen speichert und verschiedene Eingabestatusinformationen mit verschiedenen im Voraus eingestellten Grammatikregeln korrespondieren; und

eine Erzeugungseinheit (32, 42), die Erzeugungseinheit umfassend:

ein Erzeugungsmodul, konfiguriert zum Erzeugen einer Folgesymbolmenge korrespondierend mit nachfolgenden Eingabeinhaltsinformationen korrespondierend mit den Eingabeinhaltsinformationen gemäß den Eingabeinhaltsinformationen und der Umwandlungsregel, wobei die Folgesymbolmenge eine Grammatikproduktionsmenge der Umwandlungsregel, eine Nichtabschlussmenge korrespondierend mit der Grammatikproduktion und eine anfängliche Abschlussmenge korrespondierend mit der Grammatikproduktion umfasst;

ein Assoziationsmodul, konfiguriert zum Assoziieren einer Grammatikerweiterung korrespondierend mit einem Nichtabschluss in der Nichtabschlussmenge mit einer Grammatikerweiterung eines anfänglichen Abschlusses in der anfänglichen Abschlussmenge; und

ein Erzeugungsmodul, konfiguriert zum Erzeugen von Codeassistenzinformationen korrespondierend mit den Eingabeinhaltsinformationen gemäß dem assoziierten Ergebnis der Grammatikerweiterung korrespondierend mit dem Nichtabschluss mit der Grammatikerweiterung des anfänglichen Abschlusses.


 
11. Vorrichtung nach Anspruch 10, wobei die Vorrichtung ferner umfasst:
eine Ausgabeeinheit (43), konfiguriert zum Ausgeben der Codeassistenzinformationen, und wahlweise wobei die Vorrichtung ferner umfasst:

eine Empfangseinheit (45), konfiguriert zum Empfangen einer Informationsauswahlanweisung korrespondierend mit den Codeassistenzinformationen, wobei die Informationsauswahlanweisung verwendet wird, anzuweisen, Daten aus den Codeassistenzinformationen auszuwählen; und

eine Aktualisierungseinheit (46), konfiguriert zum Aktualisieren der Eingabeinhaltsinformationen gemäß den ausgewählten Daten, und wahlweise wobei die Vorrichtung ferner eine Speichereinheit (47) umfasst, konfiguriert zum Speichern der ausgewählten Daten in historische Eingabestatusinformationen.


 
12. Vorrichtung nach Anspruch 10, wobei die Vorrichtung ferner umfasst: eine Detektionseinheit (44), wobei:

die Detektionseinheit konfiguriert ist zum Detektieren, ob die Eingabeinhaltsinformationen im Voraus eingestellte Informationen umfassen, wobei die im Voraus eingestellten Informationen Informationen über spezielle Trennzeichen sind; und

die Erlangungseinheit konfiguriert ist zum: wenn die Eingabeinhaltsinformationen die im Voraus eingestellten Informationen umfassen, Durchführen des Erlangens einer im Voraus eingestellten Grammatikregel korrespondierend mit den Eingabestatusinformationen.


 
13. Vorrichtung nach Anspruch 10, wobei die Erzeugungseinheit umfasst:
ein Erlangungsmodul, konfiguriert zum Erlangen eines endlichen Automaten korrespondierend mit der im Voraus eingestellten Grammatikregel, wobei der endliche Automat eine Umwandlungsregel zwischen verschiedenen Aussageinformationen speichert.
 
14. Vorrichtung nach Anspruch 13, wobei:

das Assoziationsmodul konfiguriert ist zum: wenn die Grammatikerweiterung korrespondierend mit dem Nichtabschluss gleich der Grammatikerweiterung des anfänglichen Abschlusses ist, Bestimmen der Grammatikerweiterung des anfänglichen Abschlusses als Assistenzkandidateninformationen der nachfolgenden Eingabeinhaltsinformationen; und

das Erzeugungsmodul konfiguriert ist zum Bestimmen des anfänglichen Abschlusses und der Assistenzkandidateninformationen als die Codeassistenzinformationen korrespondierend mit den Eingabeinhaltsinformationen, und wahlweise wobei:

das Erlangungsmodul ferner konfiguriert ist zum Erlangen historischer Eingabestatusinformationen korrespondierend mit den Eingabestatusinformationen;

das Sortiermodul konfiguriert ist zum Sortieren des anfänglichen Abschlusses und der Assistenzkandidateninformationen gemäß den historischen Eingabestatusinformationen; und

das Bestimmungsmodul konfiguriert ist zum Bestimmen des sortierten anfänglichen Abschlusses und der sortierten Assistenzkandidateninformationen als die Codeassistenzinformationen korrespondierend mit den Eingabeinhaltsinformationen.


 
15. Vorrichtung nach Anspruch 13, wobei:
die Erzeugungseinheit ferner ein Bestimmungsmodul umfasst:

das Erlangungsmodul konfiguriert ist zum Erlangen einer Grammatikproduktion korrespondierend mit dem Nichtabschluss und korrespondierend mit dem anfänglichen Abschluss in der anfänglichen Abschlussmenge; und

das Bestimmungsmodul konfiguriert ist zum Bestimmen, als die Grammatikerweiterung korrespondierend mit dem Nichtabschluss, eines Ergebnisses, das erlangt wird, nachdem sämtliche Nichtabschlüsse in der Grammatikproduktion zyklisch erweitert werden, bis sämtliche Nichtabschlüsse eliminiert sind.


 


Revendications

1. Procédé mis en Ĺ“uvre par ordinateur pour générer des informations d'assistance de code, comprenant :

l'obtention (101, 201) d'informations d'état d'entrée qui correspondent à un processus de développement de programme actuel, dans lequel les informations d'état d'entrée comprennent des informations de contenu d'entrée et des informations d'environnement de langue d'entrée ;

l'obtention (102, 203) d'une règle grammaticale prédéfinie qui correspond aux informations d'état d'entrée, dans lequel la règle grammaticale prédéfinie stocke une relation d'association entre différentes informations d'énoncé, et différentes informations d'état d'entrée correspondent à différentes règles grammaticales prédéfinies ;

l'obtention d'une règle de transformation entre différentes informations d'énoncé sur la base de la règle grammaticale prédéfinie ;

la génération (205) d'un jeu de symboles de suivi qui correspond à des informations de contenu d'entrée subséquentes qui correspondent aux informations de contenu d'entrée en fonction des informations de contenu d'entrée et de la règle de transformation, dans lequel le jeu de symboles de suivi comprend un jeu de productions grammaticales de la règle de transformation, un jeu de non terminateurs qui correspond à la production grammaticale et un jeu de terminateurs initiaux qui correspond à la production grammaticale ;

l'association (206) d'une extension grammaticale qui correspond à un non terminateur dans le jeu de non terminateurs avec une extension grammaticale d'un terminateur initial dans le jeu de terminateurs initiaux ; et

la génération (103, 207) d'informations d'assistance de code qui correspondent l'information de contenu d'entrée en fonction du résultat associé de l'extension grammaticale qui correspond au non terminateur avec l'extension grammaticale du terminateur initial.


 
2. Procédé selon la revendication 1, dans lequel, après la génération d'informations d'assistance de code qui correspondent aux informations de contenu d'entrée, le procédé comprend en outre :
l'émission en sortie (208) des informations d'assistance de code.
 
3. Procédé selon la revendication 1, dans lequel, après l'obtention d'une règle grammaticale prédéfinie qui correspond aux informations d'état d'entrée, le procédé comprend en outre :

la détection de si les informations de contenu d'entrée comprennent ou ne comprennent pas des informations prédéfinies, dans lequel les informations prédéfinies sont des informations de caractères de séparation spéciaux ; et

si les informations de contenu d'entrée comprennent les informations prédéfinies, la réalisation de l'obtention d'une règle grammaticale prédéfinie qui correspond aux informations d'état d'entrée.


 
4. Procédé selon la revendication 1, dans lequel l'obtention d'une règle de transformation entre différentes informations d'énoncé sur la base de la règle grammaticale prédéfinie comprend :
l'obtention d'une machine à états finis qui correspond à la règle grammaticale prédéfinie, dans lequel la machine à états finis stocke une règle de transformation entre différentes informations d'énoncé.
 
5. Procédé selon la revendication 1, dans lequel l'association d'une extension grammaticale qui correspond à un non terminateur dans le jeu de non terminateurs avec une extension grammaticale d'un terminateur initial dans le jeu de terminateurs initiaux comprend :

lorsque l'extension grammaticale qui correspond au non terminateur est égale à l'extension grammaticale du terminateur initial, la détermination de l'extension grammaticale du terminateur initial en tant qu'informations candidates d'assistance des informations de contenu d'entrée subséquentes ; et

la génération des informations d'assistante de code qui correspondent aux informations de contenu d'entrée en fonction d'un résultat d'association comprenant :
la détermination du terminateur initial et des informations candidates d'assistance en tant qu'informations d'assistance de code qui correspondent aux informations de contenu d'entrée.


 
6. Procédé selon la revendication 1, dans lequel, avant l'association d'une extension grammaticale qui correspond à un non terminateur dans le jeu de non terminateurs avec une extension grammaticale d'un terminateur initial dans le jeu de terminateurs initiaux, le procédé comprend en outre :

l'obtention d'une production grammaticale qui correspond au non terminateur et qui correspond au terminateur initial dans le jeu de terminateurs initiaux ; et

la détermination, en tant qu'extension grammaticale qui correspond au non terminateur, d'un résultat qui est obtenu après que tous les non terminateurs dans la production grammaticale sont étendus cycliquement jusqu'à ce que tous les non terminateurs soient éliminés.


 
7. Procédé selon la revendication 5, dans lequel, avant la détermination du terminateur initial et des informations candidates d'assistance en tant qu'informations d'assistance de code qui correspondent aux informations de contenu d'entrée, le procédé comprend en outre :

l'obtention d'informations d'état d'entrée historiques qui correspondent aux informations d'état d'entrée ; et

le tri du terminateur initial et des informations candidates d'assistance en fonction des informations d'état d'entrée historiques ; et

la détermination du terminateur initial et des informations candidates d'assistance en tant qu'informations d'assistance de code qui correspondent aux informations de contenu d'entrée comprend :
la détermination du terminateur initial trié et des informations candidates d'assistance triées en tant qu'informations d'assistance de code qui correspondent aux informations de contenu d'entrée.


 
8. Procédé selon la revendication 2, dans lequel, après l'émission en sortie des informations d'assistance de code, le procédé comprend en outre :

la réception d'une instruction de sélection d'information, laquelle instruction correspond aux informations d'assistance de code, dans lequel l'instruction de sélection d'information est utilisée pour demander de choisir des données parmi les informations d'assistance de code ; et

la mise à jour des informations de contenu d'entrée en fonction des données choisies.


 
9. Procédé selon la revendication 8, dans lequel, après la mise à jour des informations de contenu d'entrée en fonction des données choisies, le procédé comprend en outre :
le stockage des données choisies à l'intérieur d'informations d'état d'entrée historiques.
 
10. Dispositif pour générer des informations d'assistance de code, comprenant :
une unité d'obtention (31, 41), qui est configurée pour :

obtenir des informations d'état d'entrée qui correspondent à un processus de développement de programme actuel, dans lequel les informations d'état d'entrée comprennent des informations de contenu d'entrée et des informations d'environnement de langue d'entrée, et obtenir une règle grammaticale prédéfinie qui correspond aux informations d'état d'entrée, dans lequel la règle grammaticale prédéfinie stocke une relation d'association entre différentes informations d'énoncé, et différentes informations d'état d'entrée correspondant à différentes règles grammaticales prédéfinies ; et

une unité de génération (32, 42), l'unité de génération comprenant :

un module de génération, qui est configuré pour générer un jeu de symboles de suivi qui correspond à des informations de contenu d'entrée subséquentes qui correspondent aux informations de contenu d'entrée en fonction des informations de contenu d'entrée et de la règle de transformation, dans lequel le jeu de symboles de suivi comprend un jeu de productions grammaticales de la règle de transformation, un jeu de non terminateurs qui correspond à la production grammaticale et un jeu de terminateurs initiaux qui correspond à la production grammaticale ;

un module d'association, qui est configuré pour associer une extension grammaticale qui correspond à un non terminateur dans le jeu de non terminateurs avec une extension grammaticale d'un terminateur initial dans le jeu de terminateurs initiaux ; et

un module de génération, qui est configuré pour générer des informations d'assistance de code qui correspondent aux informations de contenu d'entrée en fonction du résultat associé de l'extension grammaticale qui correspond au non terminateur avec l'extension grammaticale du terminateur initial.


 
11. Dispositif selon la revendication 10, dans lequel le dispositif comprend en outre :
une unité de sortie (43), qui est configurée pour émettre en sortie les informations d'assistance de code et facultativement, dans lequel le dispositif comprend en outre :

une unité de réception (45), qui est configurée pour recevoir une instruction demandant de choisir une information, laquelle instruction correspond à aux informations d'assistance de code, dans lequel l'instruction demandant de choisir une information est utilisée pour demander de choisir des données parmi les informations d'assistance de code ; et

une unité de mise à jour (46), qui est configurée pour mettre à jour les informations de contenu d'entrée en fonction des données choisies et facultativement, dans lequel le dispositif comprend en outre une unité de stockage (47), qui est configurée pour stocker les données choisies à l'intérieur d'informations d'état d'entrée historiques.


 
12. Dispositif selon la revendication 10, dans lequel le dispositif comprend en outre : une unité de détection (44), dans lequel :

l'unité de détection est configurée pour détecter si les informations de contenu d'entrée comprennent ou ne comprennent pas des informations prédéfinies, dans lequel les informations prédéfinies sont des informations de caractères de séparation spéciaux ; et

l'unité d'obtention est configurée pour : si les informations de contenu d'entrée comprennent les informations prédéfinies, réaliser l'obtention d'une règle grammaticale prédéfinie qui correspond aux informations d'état d'entrée.


 
13. Dispositif selon la revendication 10, dans lequel l'unité de génération comprend :
un module d'obtention, qui est configuré pour obtenir une machine à états finis qui correspond à la règle grammaticale prédéfinie, dans lequel la machine à états finis stocke une règle de transformation entre différentes informations d'énoncé.
 
14. Dispositif selon la revendication 13, dans lequel :

le module d'association est configuré pour : lorsque l'extension grammaticale qui correspond au non terminateur est égale à l'extension grammaticale du terminateur initial, déterminer l'extension grammaticale du terminateur initial en tant qu'informations candidates d'assistance des informations de contenu d'entrée subséquentes ; et

le module de génération est configuré pour déterminer le terminateur initial et les informations candidates d'assistance en tant qu'informations d'assistance de code qui correspondent aux informations de contenu d'entrée, et facultativement dans lequel :

le module d'obtention est en outre configuré pour obtenir des informations d'état d'entrée historiques qui correspondent aux informations d'état d'entrée ;

le module de tri est configuré pour trier le terminateur initial et les informations candidates d'assistance en fonction des informations d'état d'entrée historiques ; et

le module de détermination est configuré pour déterminer le terminateur initial trié et les informations candidates d'assistance triées en tant qu'informations d'assistance de code qui correspondent aux informations de contenu d'entrée.


 
15. Dispositif selon la revendication 13, dans lequel :

l'unité de génération comprend en outre un module de détermination ;

le module d'obtention est configuré pour obtenir une production grammaticale qui correspond au non terminateur et qui correspond au terminateur initial dans le jeu de terminateurs initiaux ; et

le module de détermination est configuré pour déterminer, en tant qu'extension grammaticale qui correspond au non terminateur, un résultat qui est obtenu après que tous les non terminateurs dans la production grammaticale sont étendus cycliquement jusqu'à ce que tous les non terminateurs soient éliminés.


 




Drawing




















Cited references

REFERENCES CITED IN THE DESCRIPTION



This list of references cited by the applicant is for the reader's convenience only. It does not form part of the European patent document. Even though great care has been taken in compiling the references, errors or omissions cannot be excluded and the EPO disclaims all liability in this regard.

Non-patent literature cited in the description