syntax tree 中文意思是什麼
syntax tree
解釋
句法樹-
A parse of a sentential form is the construction of a derivation and possibly a syntax tree for it.
句型的分析是某個推導（或許是其語法樹）的構造過程。 -
The gcc compiler scales very well - from simple batch utility programs to multimillion - line systems. it is the clear syntax tree front end, the highly recapitulative intermediate language and the concise machine description back end that help gcc port to kinds of platforms
其清晰的前端語法樹結構、高度概括的抽象機中間語言、簡潔有力的後端機器描述等三部分為快速實現多語種開發、多平臺移植提供了有力的支持。 -
If a sentential form is ambiguous, then it has more than one syntax tree and therefore, in general, more than one handle.
如果句型是二義性的，那末，它不只有一棵語法樹，因此，一般地說，也不只有一個句柄。 -
A parse of a sentential form is the construction of a derivation and possibly a syntax tree for it
句型的分析是某個推導（或許是其語法樹）的構造過程。 -
According to the program structure of ansi c, some syntax - tree - nodes are designed in front - end, including function, block, data structure, type, expression, identifier and so on. syntax tree is divided into three levels, namely program level, function level and block level, which are useful for analysis of syntax and semantic in compiler as well as transferring syntax tree into rtl. retargetable compiler mainly includes intermediate representation, machine description and interface technique between compiler and machine description
編譯前端的實現技術包括詞法分析、語法語義分析和中間代碼生成技術等，針對ansic的程序結構，分別設計了函數、塊、數據結構、類型、表達式、標識符等語法樹結點，並將語法樹分成編譯層次、函數聲明和塊三個不同層次，使語法樹具有清晰的層次結構，有利於編譯程序的語法和語義分析，以及從語法樹到rtl中間表示的轉換。 -
Aiming at this problem, the main research issues and achievements in this paper are as follows : bi - directional data transformation between rdb and xml with semantic constraints preserved for most of existing researches on static data transformation between xml and rdb, dtd is taken as the schema description language for xml, and the semantic constraints are often lost during the transformation process. to overcome these disadvantages, the author adopts xml - schema, a standard schema description language proposed by w3c to replace dtd, as the description method owing to its more powerful functions than dtd, and of course with the syntax much more complicated. after analyzing the constraints characteristics in both xml - schema and relational schema, a semantic constraints - preserved algorithm is proposed which can realize the bi - directional schema mapping between rdb and xml through a formalized description of xml based on regular tree and a general expression for relational schema based on direct graph approach
保留語義約束的xml與rdb雙向靜態數據轉換技術現有研究大多採用dtd （ documenttypedefinition ，文檔類型定義）作為xml的模式描述語言，並且在模式映射過程中丟失語義約束信息，本文分析了xml - schema （ xml - schema採用與dtd完全不同的語法，數據描述能力更強同時也更為復雜，已被w3c確定為替代dtd作為xml模式描述語言的標準）及關系模式的語義約束特徵，通過基於正則樹的xml形式化描述方法以及基於有向圖的一般關系模式表示方法的研究，建立保留語義約束的xml - schema與關系模式的雙向模式映射演算法，實現了xml與rdb的雙向數據轉換，較好地解決了xml與rdb在靜態數據轉換層面的數據集成問題，可有效滿足企業大量rdb數據面向xml的發布以及與日俱增的xml數據存入rdb的應用需求。 -
Firstly, for the errors of text ’ character and word, utilizing neighborship of character or word, check character and word errors by character string co - occurrence probability. secondly, for the errors of syntax of text, according to statistic and analysis of a large - scale contemporary chinese corpus, recognize the predicate focus word and the others sentence ingredient, check the syntax errors. thirdly, for the errors of text ’ semanteme, establishing semantic dependency relationship tree based on hownet knowledge, presents a method that based on semantic dependency relationship analysis to compute sentence similarity, check the semantic errors
對于文本字詞錯誤的檢查，本文主要利用了字詞二元接續關系，根據同現概率檢查文本字詞錯誤;對于文本語法錯誤的檢查，本文利用教研室已有的一個大規模語料庫，通過對語料庫進行統計分析，獲得語法查錯所需要的語言規律和知識，利用謂語中心詞識別和其他句子成分識別的方法，檢查文本語法結構上的錯誤;對于文本語義錯誤的檢查，本文主要利用知網知識得到語義依存樹，通過對句子的有效搭配對的相似度計算檢查語義錯誤。 -
An integrated ufo _ syntax _ tree is built
建立一顆完整的ufo語法樹。 -
Traverses the abstract syntax tree one or more times, collecting information and checking that the input program
遍歷抽象語法樹（ abstract syntax tree ， ast ）一次或多次，收集信息並檢查輸入程序 -
This paper introduced a kind of variable type collecting method, which is based on layered thoughtway and abstract syntax tree
摘要提出了一種基於分層思想的，並且無需構造具體語法樹的變量類型提取方法。 -
An abstract syntax tree is built after syntax analysis and traversed three times to do semantic analysis to generate the intermediate code
在語法分析、語義分析及中間代碼生成方面，先經過語法分析建立抽象語法樹，然後對抽象語法樹進行三次遍歷完成語義分析並生成中間代碼。 -
It takes a plain javacc grammar file as input and automatically generates the following : a set of syntax tree classes based on the productions in the grammar using the visitor design pattern ; two interfaces visitor and objectvisitor ; two depth - first visitors depthfirstvisitor and objectdepthfirst ; and a javacc grammar with the proper annotations to build the syntax tree during parsing
它把普通的javacc語法文件作為輸入並自動生成下列各項：基於語法中的生成的一組語法樹類（使用visitor設計模式） ；兩個介面（ visitor和objectvisitor ） ；兩個深度優先訪問器（ depthfirstvisitor和objectdepthfirst ） ；和一個帶正確注釋的javacc語法（用於在解析期間構建語法樹） 。 -
Writes the output tree according to the html or xml syntax
根據html或者xml語法寫入輸出樹。 -
You can add new rules, either by writing java code and recompiling pmd or, a little more simply, by writing xpath expressions that are resolved against each java class s abstract syntax tree
您可以添加新規則：可以通過編寫java代碼並重新編譯pdm ，或者更簡單些，編寫xpath表達式，它會針對每個java類的抽象語法樹進行處理。 -
You would never use a scanner to analyze an entire java source ; for that you would turn to something quite familiar to compiler aficionados : the jdt s abstract syntax tree framework
您決不會使用掃描程序分析整個java源代碼；因為您會轉而使用一些對編譯器迷而言十分熟悉的工具： jdt的抽象語法樹（ abstract syntax tree ， ast ）框架。 -
Existent automatic grading model of programs can not deal with the programs with structural body. in this paper, we study the syntax and concept of structural body based on an existed model, and improve the original model in the following aspects : increasing the middle representation form of structural body in analysis of morphology and syntax and system dependence graph and abstract syntax tree, adding standardization rules, mainly including type definition, nesting structure, initialization, function invocation, renaming and sequence of program sentence, besides standardization rules of bit operation and program with enumeration, enhancing the function of inspecting syntax error and improving matching strategies
本文在原有的編程題自動評分模型的基礎上，對結構體的語法結構和實現原理進行研究，並在以下幾個方面完善原有模型:在詞法和語法分析、程序的系統依賴圖建立和抽象語法樹生成三個方面增加結構體類型的中間表示形式;擴充程序的標準化規則，主要包括類型定義標準化、結構體嵌套結構標準化、結構體初始化的標準化、結構體作為函數參數時函數調用標準化、結構體變量名稱標準化、結構體語句排列順序標準化等等;另外，還增加了位運算標準化、枚舉標準化以及文件的處理;增強學生程序中語法錯誤的檢測和改進程序匹配策略。 -
The following works have been done : ( 1 ) define csl language and complete the lexical analysis and syntactical analysis of it ; ( 2 ) obtain control flow graph ( later referred as cfg ) from abstract syntax tree ( ast ) ; ( 3 ) control dependence analysis of csl ; ( 4 ) system architecture of csl slicing system
內容包括通過語法分析獲得源程序的抽象語法樹，從抽象語法樹構造控制流圖，在控制流圖上做控制流分析獲得源程序的控制依賴關系，在控制流圖上做數據流分析獲得源程序的數據依賴關系，以及最後獲得源程序的程序依賴圖並以圖可達性演算法獲得程序分片的全過程。 -
This dissertation systematically generalizes theory, methods and techniques of software metrics, depicts an inproved software quality metrics model and brings forward a new software metrics tool architecture that based on abstract syntax tree. a software metrics tools named emmetrics is designed and implemented based on the new architecture, so metrics data can be automatically collected, analyzed and exhibited
本文系統歸納了軟體度量的理論、方法和技術，改進了已有的軟體質量度量模型，提出了一種以抽象語法樹為核心的度量工具的體系結構，並且基於該體系結構設計並實現了一個自動化軟體度量工具emmetrics ，實現了度量數據的自動採集、分析與展示。 -
In this paper, we firstly study two wcet analysis methods ( control flow graph based wcet analysis method and syntax tree based wcet analysis method ), and get integrated comprehension on the static wcet analysis
本文首先研究了兩種wcet分析方法（基於控制流圖的wcet分析方法和基於語法樹的wcet分析方法） ，加深了對靜態wcet分析的理解。 -
Start generating depth - first visitors automatically with the java tree builder, a syntax tree builder used with the java compiler compiler javacc parser generator
開始自動生成深度優先訪問器， java樹構建器它是一種與java compiler compiler （ javacc ）解析生成器一起使用的語法樹構建器。
分享友人