CN107329974A - Data extraction method and its system for HLS optimizations - Google Patents
Data extraction method and its system for HLS optimizations Download PDFInfo
- Publication number
- CN107329974A CN107329974A CN201710382608.9A CN201710382608A CN107329974A CN 107329974 A CN107329974 A CN 107329974A CN 201710382608 A CN201710382608 A CN 201710382608A CN 107329974 A CN107329974 A CN 107329974A
- Authority
- CN
- China
- Prior art keywords
- character
- function
- data
- array
- equal
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F16/36—Creation of semantic tools, e.g. ontology or thesauri
- G06F16/374—Thesaurus
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F16/33—Querying
- G06F16/332—Query formulation
- G06F16/3329—Natural language query formulation or dialogue systems
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Computational Linguistics (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Mathematical Physics (AREA)
- Artificial Intelligence (AREA)
- Human Computer Interaction (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a kind of data extraction method and its system for HLS optimizations, method includes：Crucial character word stock is created according to default algorithmic language；It is partitioned into each function in source file；The top layer function searched in source file, and record the function name and interface parameters of the top layer function；The function name and interface parameters data, array data and loop-around data in source file are extracted according to the crucial character word stock；Export the function data, array data and loop-around data.By creating crucial character word stock, data extraction is then carried out to source file according to crucial character word stock, it is possible to prevente effectively from extracting the data made mistake, the accuracy that data are extracted is improved.
Description
Technical field
The present invention relates to field of computer technology, more particularly to a kind of data extraction method for HLS optimizations and
Its system.
Background technology
In recent years, the upsurge sustainable development of deep learning, when carrying out deep learning, deep learning model is to precision and calculating
Capability Requirement is very high, only accelerates that requirement could be met by more preferable hardware.
It is difficult that HLS (High Level Synthesis, High Level Synthesis) instrument overcomes the exploitation of conventional hardware description language
The shortcomings of degree is big, the cycle is long, allows software developer excessively to pay close attention to hardware knowledge preferably hardware-accelerated with regard to that can design
Algorithm.It by high-level language translations such as C or C++ is hardware language that HLS effect, which is, and carries out algorithm optimization and hardware-accelerated.HLS
Mainly by choose series of optimum instruct, such as loop unrolling, array split, to the array of algorithm, circulation, function and
Interface etc. is optimized.Therefore, the pith that optimization instruction is HLS algorithm optimizations is reasonably chosen.
HLS optimization refers to that by using certain intelligent algorithm being chosen in substantial amounts of optimization instruction most rationally has
The optimization instructing combination of effect carrys out optimized algorithm, so as to reach the purpose of algorithm optimization.Generally, one section of C or C++ code
Array, circulation, function and interface parameters are very more, are treated when carrying out HLS optimization using intelligent algorithm, it is necessary to extract
These data messages are encoded and iteration by function name, array, circulation and interface parameters in optimized algorithm, final
To optimal solution, i.e., optimal optimization instructing combination.Therefore, function name, array, circulation and interface ginseng exactly in extraction algorithm
Number is the premise of HLS optimizations.
The content of the invention
The technical problems to be solved by the invention are：A kind of data extraction method and its system for HLS optimizations,
The data such as function name, array, circulation and interface parameters that can exactly in extraction algorithm.
In order to solve the above-mentioned technical problem, the technical solution adopted by the present invention is：
A kind of data extraction method for HLS optimizations, including：
Crucial character word stock is created according to default algorithmic language；
It is partitioned into each function in source file；
The top layer function searched in source file, and record the function name and interface parameters of the top layer function；
Function name and interface parameters data in source file, array data are extracted according to the crucial character word stock and is followed
Loop data；
Export the function name and interface parameters data, array data and loop-around data.
Another technical scheme that the present invention is used for：
A kind of data extraction system for HLS optimizations, including：
Creation module, for creating crucial character word stock according to default algorithmic language；
Split module, for each function being partitioned into source file；
First logging modle, for searching for the top layer function in source file, and records the function name of the top layer function
And interface parameters；
Extraction module, for extracting function name and interface parameters number in source file according to the crucial character word stock
According to, array data and loop-around data；
Output module, for exporting the function name and interface parameters data, array data and loop-around data.
The beneficial effects of the present invention are：By creating crucial character word stock, then source file is entered according to crucial character word stock
Row data are extracted, it is possible to prevente effectively from extracting the data made mistake, improve the accuracy that data are extracted.
Brief description of the drawings
Fig. 1 is the flow chart of the data extraction method for HLS optimizations of the present invention；
Fig. 2 is the flow chart 1 of the data extraction method for HLS optimizations of embodiments of the invention one；
Fig. 3 is the flow chart 2 of the data extraction method for HLS optimizations of embodiments of the invention one；
Fig. 4 is the flow chart 3 of the data extraction method for HLS optimizations of embodiments of the invention one；
Fig. 5 is the schematic diagram of the data extraction system for HLS optimizations of the present invention；
Fig. 6 is the schematic diagram of the data extraction system for HLS optimizations of embodiments of the invention two.
Label declaration：
1st, creation module；2nd, module is split；3rd, the first logging modle；4th, extraction module；5th, output module；6th, the second record
Module；41st, the first Traversal Unit；42nd, the first judging unit；43rd, the first searching unit；44th, the first recording unit；45th, second
Traversal Unit；46th, the second judging unit；47th, the second recording unit；48th, the 3rd recording unit；49th, the 3rd Traversal Unit；410、
4th recording unit；
411st, the second searching unit；412nd, the 5th recording unit.
Embodiment
To describe technology contents, the objects and the effects of the present invention in detail, below in conjunction with embodiment and coordinate attached
Figure is explained.
The design of most critical of the present invention is:By creating crucial character word stock, then according to crucial character word stock to source file
Data extraction is carried out, it is possible to prevente effectively from extracting the data made mistake, the accuracy that data are extracted is improved.
It refer to Fig. 1, a kind of data extraction method for HLS optimizations, including：
Crucial character word stock is created according to default algorithmic language；
It is partitioned into each function in source file；
The top layer function searched in source file, and record the function name and interface parameters of the top layer function；
Function name and interface parameters data in source file, array data are extracted according to the crucial character word stock and is followed
Loop data；
Export the function name and interface parameters data, array data and loop-around data.
It was found from foregoing description, the beneficial effects of the present invention are：By creating crucial character word stock, then according to keyword
Dictionary carries out data extraction to source file, it is possible to prevente effectively from extracting the data made mistake, improves the accuracy that data are extracted.
Further, it is described function data in source file is extracted according to the crucial character word stock to be specially：
By the character in row traversal source file；
When the character string that character is constituted is identical with the keyword in the crucial character word stock, determine whether that parameter is transmitted
Interface；
If so, then recording function name, and current line number is set one etc. as the initial row of function when next line starts
In 1 identifier and searched；
When the character of traversal is equal to ' identifier adds 1 when { ', equal to ' } ', then identifier subtracts 1, when identifier is zero
Record the end line that current line number is function.
Further, it is described array data in source file is extracted according to the crucial character word stock to be specially：
According to the initial row and end line of function, the character per a line in function body is traveled through；
When the character string that character is constituted is identical with the keyword in crucial character word stock, next space or ', ' are judged
Whether the character of traversal is equal to ' [' before arriving；
If so, then the character string of current character composition is array, array name is recorded；
Character is equal to ' number of times of [' represents array depth, records array depth before being arrived in next space or ', '.
Further, it is described loop-around data in source file is extracted according to the crucial character word stock to be specially：
According to the initial row and end line of function, the character per a line in function body is traveled through；
If the character of traversal constitutes " for ", the previous vocabulary of record current vocabulary is cycle names；
One flag bit for being equal to 1 is set after next line starts and searched；
If current character equal to ' flag bit adds 1 if { ', and current character is equal to ' } ', and then flag bit subtracts 1；When flag bit
If running into the character string of " for " when 0, depth of round adds 1；Terminate to search when flag bit is equal to 0, in respective function under one's name
Record cycle names and depth of round.
Seen from the above description, traveled through by using by row traversal and in the way of character traversal is combined in source file
Data, the character string that each character and each character that can be more accurately in cognizance code be constituted, can greatly reduce
Extract the possibility omitted during data.
Further, also include after the function name and interface parameters for recording the top layer function：Connect when described
When mouth parameter is array, record array dimension is as parameter depth, and otherwise, parameter depth is designated as 0.
Further, it is described to be specially according to the crucial character word stock of default algorithmic language establishment：From default C/C++ language
Keyword is extracted in keyword document, the keyword extracted is stored into keyword container.
Seen from the above description, carry out to write by C Plus Plus during data extraction, two kinds of languages of C and C++ can be extracted
The algorithm write is sayed, and has the advantages that simple in construction and extraction rate is fast.
Further, described store the keyword extracted into keyword container also includes before：Create keyword
Container.
Fig. 5 is refer to, another technical scheme of the invention is：
A kind of data extraction system for HLS optimizations, including：
Creation module, for creating crucial character word stock according to default algorithmic language；
Split module, for each function being partitioned into source file；
First logging modle, for searching for the top layer function in source file, and records the function name of the top layer function
And interface parameters；
Extraction module, for extracting function name and interface parameters number in source file according to the crucial character word stock
According to, array data and loop-around data；
Output module, for exporting the function name and interface parameters data, array data and loop-around data.
Further, the extraction module is specifically included：
First Traversal Unit, for by the character in row traversal source file；
First judging unit, for when the character string that character is constituted is identical with the keyword in the crucial character word stock,
Determine whether parameter passing interface；
Searching unit, for if so, then record function name, and using current line number as the initial row of function, next line opens
One identifier for being equal to 1 is set during the beginning and searched；
First recording unit, for when traversal character be equal to ' identifier adds 1 when { ', equal to ' } ' when then identifier subtract 1,
The end line that current line number is function is recorded when identifier is zero.
Further, the extraction module is specifically included：
Second Traversal Unit, for the initial row and end line according to function, travels through the character per a line in function body；
Second judging unit, for when the character string that character is constituted is identical with the keyword in crucial character word stock, sentencing
Whether the character of traversal is equal to ' [' before disconnected next space or ', ' arrive；
Second recording unit, for if so, then current character composition character string be array, record array name；
3rd recording unit, for before next space or ', ' are arrived character be equal to ' number of times of [' represents array depth,
Record array depth.
Further, the extraction module is specifically included：
3rd Traversal Unit, for the initial row and end line according to function, travels through the character per a line in function body；
4th recording unit, if constituting " for " for the character traveled through, the previous vocabulary of record current vocabulary is to follow
Ring title；
Second searching unit, for setting a flag bit for being equal to 1 after next line starts and being searched；
5th recording unit, for being equal to if current character, ' flag bit adds 1 if { ', and current character is equal to ' } ' then flag bit
Subtract 1；If running into the character string of " for " when flag bit is not equal to 0, depth of round adds 1；Terminate to look into when flag bit is equal to 0
Look for, cycle names and depth of round are recorded under one's name in respective function.
Further, in addition to the second logging modle, for when the interface parameters is array, record array dimension to be made
For parameter depth, otherwise, parameter depth is designated as 0.
Further, the creation module is from default C/C++ language keywords document specifically for extracting keyword,
The keyword extracted is stored into keyword container.
Further, the creation module is additionally operable to create keyword container.
Embodiment one
Fig. 1 to Fig. 4 is refer to, embodiments of the invention one are：
A kind of data extraction method for HLS optimizations, it is possible to prevente effectively from extracting the data made mistake, improves number
According to the accuracy of extraction, including：
S1, establishment keyword container.
S2, crucial character word stock created according to default algorithmic language, be specially：From default C/C++ language keywords text
Keyword is extracted in shelves, the keyword extracted is stored into keyword container.In the present embodiment, C/ can also be added manually
The important keyword of C Plus Plus.The keyword extracted is put into the keyword container of establishment, due to the header file in algorithm
In also have keyword by macrodefinition, accordingly, it would be desirable to travel through header file, extract this kind of keyword and be stored in keyword appearance in the lump
In device.The present embodiment is not limited to C/C++ language, it would however also be possible to employ other language, it is preferred that the present embodiment carries out data extraction
When write by C Plus Plus.
S3, each function being partitioned into source file.Because code is made up of multiple functions, it is therefore desirable to be partitioned into each
The data extraction to each function is carried out after function again.
Top layer function in S4, search source file, and record the function name and interface parameters of the top layer function.In head
The statement part of top layer function is had in file, it is therefore desirable to travel through the statement part that header file searches top layer function, record top
The function name and interface parameters of layer functions.When the interface parameters is array, record array dimension is no as parameter depth
Then, parameter depth is designated as 0.
S5, function name and interface parameters data, the array data extracted according to the crucial character word stock in source file
And loop-around data.It refer in Fig. 2, the present embodiment, step S5 is specifically included：
S501, by row traversal source file in character.
S502, when character constitute character string it is identical with the keyword in the crucial character word stock when, determine whether join
Number passing interface；If so, then carrying out step S503.If the keyword in the character string of character composition and crucial character word stock is not
Together, then skip.
S503, record function name, and current line number is set one when next line starts and be equal to as the initial row of function
1 identifier is simultaneously searched.
S504, when traversal character be equal to ' identifier adds 1 when { ', equal to ' } ' when then identifier subtract 1, until identifier is
The end line that current line number is function is recorded when zero.
Said process has been traveled through to be terminated after all functions.
It refer in Fig. 3, the present embodiment, step S5 specifically also includes：
Character in S505, initial row and end line according to function, traversal function body per a line.
S506, when the character string that character is constituted is identical with the keyword in crucial character word stock, judge next space
Or whether ', ' arrives the preceding character traveled through equal to ' ['；If so, then carrying out step S507；If it is not, it is not array then to judge, skip
Continue to travel through function body.
S507, the character string of current character composition are array, record array name.
S508, arrived in next space or ', ' before character be equal to that ' number of times of [' represents array depth, records array depth.
Said process terminates after all function bodies have been traveled through.
It refer in Fig. 4, the present embodiment, step S5 specifically also includes：
Character in S509, initial row and end line according to function, traversal function body per a line.
If the character of S510, traversal constitutes " for ", the previous vocabulary of record current vocabulary is cycle names.
S511, after next line starts set one be equal to 1 flag bit and searched.
S512, if current character be equal to ' flag bit adds 1 if { ', current character be equal to ' } ' then flag bit subtracts 1；Work as flag bit
If running into the character string of " for " when being not equal to 0, depth of round adds 1；Terminate to search when flag bit is equal to 0, in respective function
Cycle names and depth of round are recorded under one's name.
Said process terminates after all function bodies have been traveled through.
S6, the output function name and interface parameters data, array data and loop-around data.Extract and terminate in data
Afterwards, final output is extracted top layer function name, interface parameters, parameter depth, the function name of each function, the name of circulation
Claim and depth and array title and depth.
In the present embodiment, source file is traveled through using by row traversal and in the way of character traversal is combined, can be more accurate
The character string that each character and each character in true ground cognizance code are constituted, data are omitted when can greatly reduce extraction
Possibility；By building crucial character word stock, the mode contrasted using the keyword in crucial character word stock and character string carries out data
Extract, can avoid extracting the data made mistake, improve the accuracy that data are extracted；Carry out passing through C Plus Plus during data extraction
Write, the algorithm that C and C++ bilinguals are write can be extracted, and there is the characteristics of simple in construction and extraction rate is fast.
Embodiment two
Fig. 6 is refer to, embodiments of the invention two are：A kind of data extraction system for HLS optimizations, it is and above-mentioned
The method of embodiment is corresponding, including：
Creation module 1, for creating crucial character word stock according to default algorithmic language；
Split module 2, for each function being partitioned into source file；
First logging modle 3, for searching for the top layer function in source file, and records the function name of the top layer function
And interface parameters；
Extraction module 4, for extracting function name and interface parameters number in source file according to the crucial character word stock
According to, array data and loop-around data；
Output module 5, for exporting the function name and interface parameters data, array data and loop-around data.
Further, the extraction module 4 is specifically included：
First Traversal Unit 41, for by the character in row traversal source file；
First judging unit 42, for when the character string that character is constituted it is identical with the keyword in the crucial character word stock
When, determine whether parameter passing interface；
First searching unit 43, for if so, then record function name, and using current line number as function initial row, under
One identifier for being equal to 1 is set when a line starts and searched；
First recording unit 44, for then identifier to subtract when the character of traversal is equal to ' identifier adds 1 when { ', equal to ' } '
1, the end line that current line number is function is recorded when identifier is zero.
Further, the extraction module 4 is specifically included：
Second Traversal Unit 45, for the initial row and end line according to function, travels through the character per a line in function body；
Second judging unit 46, for when the character string that character is constituted is identical with the keyword in crucial character word stock,
Judge whether the character that next space or ', ' travel through before arriving is equal to ' ['；
Second recording unit 47, for if so, then current character composition character string be array, record array name；
3rd recording unit 48, for arriving preceding character equal to ' it is deep that the number of times of [' represents array in next space or ', '
Degree, records array depth.
Further, the extraction module 4 is specifically included：
3rd Traversal Unit 49, for the initial row and end line according to function, travels through the character per a line in function body；
4th recording unit 410, if constituting " for " for the character traveled through, records the previous vocabulary of current vocabulary
For cycle names；
Second searching unit 411, for setting a flag bit for being equal to 1 after next line starts and being searched；
5th recording unit 412, for being equal to if current character, ' flag bit adds 1 if { ', and current character is then marked equal to ' } '
Will position subtracts 1；If running into the character string of " for " when flag bit is not equal to 0, depth of round adds 1；Tied when flag bit is equal to 0
Beam is searched, and cycle names and depth of round are recorded under one's name in respective function.
Further, in addition to the second logging modle 6, for when the interface parameters is array, recording array dimension
As parameter depth, otherwise, parameter depth is designated as 0.
Further, the creation module 1 is crucial specifically for being extracted from default C/C++ language keywords document
Word, the keyword extracted is stored into keyword container.
Further, the creation module 1 is additionally operable to create keyword container.
In summary, a kind of data extraction method and its system for HLS optimizations that the present invention is provided, can
The character string constituted with each character and each character that accurately identify in code, data are omitted when can greatly reduce extraction
Possibility；Data extraction is carried out using the mode of the character string contrast in crucial character word stock and code, can avoid extracting wrong
Data, improve the accuracy that data are extracted by mistake.
Embodiments of the invention are the foregoing is only, are not intended to limit the scope of the invention, it is every to utilize this hair
The equivalents that bright specification and accompanying drawing content are made, or the technical field of correlation is directly or indirectly used in, similarly include
In the scope of patent protection of the present invention.
Claims (10)
1. a kind of data extraction method for HLS optimizations, it is characterised in that including：
Crucial character word stock is created according to default algorithmic language；
It is partitioned into each function in source file；
The top layer function searched in source file, and record the function name and interface parameters of the top layer function；
The function name and interface parameters data, array data and period in source file are extracted according to the crucial character word stock
According to；
Export the function name and interface parameters data, array data and loop-around data.
2. the data extraction method according to claim 1 for HLS optimizations, it is characterised in that described according to institute
Stating the function data that crucial character word stock extracted in source file is specially：
By the character in row traversal source file；
When the character string that character is constituted is identical with the keyword in the crucial character word stock, determine whether that parameter transmission connects
Mouthful；
If so, then recording function name, and current line number is set one and be equal to 1 as the initial row of function when next line starts
Identifier and searched；
When the character of traversal is equal to ' identifier adds 1 when { ', equal to ' } ', then identifier subtracts 1, is recorded when identifier is zero
Current line number is the end line of function.
3. the data extraction method according to claim 2 for HLS optimizations, it is characterised in that described according to institute
Stating the array data that crucial character word stock extracted in source file is specially：
According to the initial row and end line of function, the character per a line in function body is traveled through；
When the character string that character is constituted is identical with the keyword in crucial character word stock, judge that next space or ', ' arrive
Whether the character of preceding traversal is equal to ' ['；
If so, then the character string of current character composition is array, array name is recorded；
Character is equal to ' number of times of [' represents array depth, records array depth before being arrived in next space or ', '.
4. the data extraction method according to claim 2 for HLS optimizations, it is characterised in that described according to institute
Stating the loop-around data that crucial character word stock extracted in source file is specially：
According to the initial row and end line of function, the character per a line in function body is traveled through；
If the character of traversal constitutes " for ", the previous vocabulary of record current vocabulary is cycle names；
One flag bit for being equal to 1 is set after next line starts and searched；
If current character equal to ' flag bit adds 1 if { ', and current character is equal to ' } ', and then flag bit subtracts 1；When flag bit is not equal to 0
If running into the character string of " for ", depth of round adds 1；Terminate to search when flag bit is equal to 0, recorded under one's name in respective function
Cycle names and depth of round.
5. the data extraction method according to claim 1 for HLS optimizations, it is characterised in that the record institute
Also include after the function name and interface parameters of stating top layer function：When the interface parameters is array, array dimension is recorded
As parameter depth, otherwise, parameter depth is designated as 0.
6. the data extraction method according to claim 1 for HLS optimizations, it is characterised in that the basis is pre-
If algorithmic language create crucial character word stock and be specially：Keyword is extracted from default C/C++ language keywords document, will be carried
The keyword got is stored into keyword container.
7. the data extraction method according to claim 6 for HLS optimizations, it is characterised in that described to extract
To keyword store into keyword container before also include：Create keyword container.
8. a kind of data extraction system for HLS optimizations, it is characterised in that including：
Creation module, for creating crucial character word stock according to default algorithmic language；
Split module, for each function being partitioned into source file；
First logging modle, for searching for the top layer function in source file, and records the function name of the top layer function and connects
Mouth parameter；
Extraction module, for extracting function name and interface parameters data, number in source file according to the crucial character word stock
Group data and loop-around data；
Output module, for exporting the function name and interface parameters data, array data and loop-around data.
9. the data extraction system according to claim 8 for HLS optimizations, it is characterised in that the extraction mould
Block is specifically included：
First Traversal Unit, for by the character in row traversal source file；
First judging unit, for when the character string that character is constituted is identical with the keyword in the crucial character word stock, judging
Whether parameter passing interface is had；
First searching unit, for if so, then record function name, and using current line number as the initial row of function, next line opens
One identifier for being equal to 1 is set during the beginning and searched；
First recording unit, for when traversal character be equal to ' identifier adds 1 when { ', equal to ' } ' when then identifier subtract 1, until
The end line that current line number is function is recorded when identifier is zero.
10. the data extraction system according to claim 8 for HLS optimizations, it is characterised in that the extraction mould
Block is specifically included：
Second Traversal Unit, for the initial row and end line according to function, travels through the character per a line in function body；
Second judging unit, for when the character string that character is constituted is identical with the keyword in crucial character word stock, under judgement
Whether the character of traversal is equal to ' [' before one space or ', ' arrive；
Second recording unit, for if so, then current character composition character string be array, record array name；
3rd recording unit, for the preceding character that arrived in next space or ', ' equal to ' number of times of [' represents array depth, record
Array depth.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710382608.9A CN107329974A (en) | 2017-05-26 | 2017-05-26 | Data extraction method and its system for HLS optimizations |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710382608.9A CN107329974A (en) | 2017-05-26 | 2017-05-26 | Data extraction method and its system for HLS optimizations |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107329974A true CN107329974A (en) | 2017-11-07 |
Family
ID=60192882
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710382608.9A Pending CN107329974A (en) | 2017-05-26 | 2017-05-26 | Data extraction method and its system for HLS optimizations |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107329974A (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050262502A1 (en) * | 2004-05-18 | 2005-11-24 | Oracle International Corporation | Product packaging and installation mechanism |
| CN103473221A (en) * | 2013-09-16 | 2013-12-25 | 于江德 | Chinese lexical analysis method |
| CN103488460A (en) * | 2013-09-04 | 2014-01-01 | 用友软件股份有限公司 | System and method for automatically marking source code |
| CN106021116A (en) * | 2016-06-07 | 2016-10-12 | 北京信息科技大学 | Inaccessible function call path detection method in complex system |
-
2017
- 2017-05-26 CN CN201710382608.9A patent/CN107329974A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050262502A1 (en) * | 2004-05-18 | 2005-11-24 | Oracle International Corporation | Product packaging and installation mechanism |
| CN103488460A (en) * | 2013-09-04 | 2014-01-01 | 用友软件股份有限公司 | System and method for automatically marking source code |
| CN103473221A (en) * | 2013-09-16 | 2013-12-25 | 于江德 | Chinese lexical analysis method |
| CN106021116A (en) * | 2016-06-07 | 2016-10-12 | 北京信息科技大学 | Inaccessible function call path detection method in complex system |
Non-Patent Citations (1)
| Title |
|---|
| CBUTTONST: "C++源代码的函数识别", 《HTTPS://BLOG.CSDN.NET/CBUTTONST/ARTICLE/DETAILS/8885816》 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108052547B (en) | Natural language question-answering method and system based on question sentence and knowledge graph structural analysis | |
| CN111090461B (en) | Code annotation generation method based on machine translation model | |
| CN107491561B (en) | Ontology-based urban traffic heterogeneous data integration system and method | |
| CN109492077A (en) | The petrochemical field answering method and system of knowledge based map | |
| CN104484411B (en) | A kind of construction method of the semantic knowledge-base based on dictionary | |
| CN106649260A (en) | Product feature structure tree construction method based on comment text mining | |
| CN105975625A (en) | Chinglish inquiring correcting method and system oriented to English search engine | |
| CN105389329B (en) | A kind of open source software recommended method based on community review | |
| CN1277192C (en) | A log analyzing system and analytical method based on the system | |
| CN103885939A (en) | Uyghur-Chinese bi-directional translation memory system construction method | |
| CN104636466A (en) | Entity attribute extraction method and system oriented to open web page | |
| CN102394061B (en) | Text-to-speech method and system based on semantic retrieval | |
| CN106095778A (en) | The Chinese search word automatic error correction method of search engine | |
| CN109062894A (en) | The automatic identification algorithm of Chinese natural language Entity Semantics relationship | |
| CN110189831A (en) | A kind of case history knowledge mapping construction method and system based on dynamic diagram sequences | |
| US20180232351A1 (en) | Joining web data with spreadsheet data using examples | |
| CN107807910A (en) | A kind of part-of-speech tagging method based on HMM | |
| CN110263332A (en) | A kind of natural language Relation extraction method neural network based | |
| CN103440233A (en) | Automatic sScientific paper standardization automatic detecting and editing system | |
| CN110147544A (en) | A kind of instruction generation method, device and relevant device based on natural language | |
| CN103927330A (en) | Method and device for determining characters with similar forms in search engine | |
| CN103246732A (en) | Online Web news content extracting method and system | |
| CN110377751A (en) | Courseware intelligent generation method, device, computer equipment and storage medium | |
| CN105677638A (en) | Web information extraction method | |
| CN110516145A (en) | Information searching method based on sentence vector coding |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20171107 |