parse tree 中文意思是什麼

parse tree 解釋
語法分析樹
  • parse : vt. 【語言學】從語法上分析；解析（詞句等）。
  • tree : n 特里〈姓氏〉。n 1 樹〈主要指喬木，也可指較大的灌木〉。 ★玫瑰可以稱為 bush 也可以稱為 tree 2 木...
  1. A parse of a sentential form is the construction of a derivation and possibly a syntax tree for it.

    句型的分析是某個推導（或許是其語法樹）的構造過程。
  2. A parse of a sentential form is the construction of a derivation and possibly a syntax tree for it

    句型的分析是某個推導（或許是其語法樹）的構造過程。
  3. As i mentioned above, a scheme program is just a collection of lists, and each list is a parse tree that is run through scheme s evaluator to produce a result

    如前所述，一個scheme程序只不過是列表的集合，每個列表都是一個解析樹，都通過scheme的求值程序生成一個結果。
  4. It can parse static html document and build html dom tree, it is not support dhtml

    可解析靜態html並生成文檔對象模型樹，不支持動態html 。
  5. The parse tree for this might look something like this

    與此對應的解析樹如下所示：
  6. A special node to mark the end of the parse tree

    標志解析樹結束的特殊節點
  7. As data and not as a part of your parse tree

    作為數據，而不是用它作為解析樹的一部分。
  8. Given the parse tree, you apply the algorithm in

    給定解析樹，可以應用
  9. Your application could do more interesting things with the parse tree

    您的應用程序可以用解析樹做更多有趣的事情。
  10. The provider will reparse the codedom tree and pass the resulting parse tree to the

    該提供程序將重新分析codedom樹，並將生成的分析樹傳遞到
  11. In fact, the example parse tree you looked at previously is almost a valid scheme program

    實際上，前面所研究的解析樹示例幾乎就是一個合法的scheme程序。
  12. This is done in order to release the memory allocated to contain the internal xml tree representation that was created during the parse phase

    這樣做是為了釋放已分配的內存，以包含在分析階段創建的內部xml樹表示形式。
  13. Client - side parsing algorithm is designed and implemented to parse md dataset, which is encapsulated with xml on server - side. in order to store and access md dataset, dynamic - depth tree model for md dataset is designed and implemented

    包括有：客戶端多維數據解析演算法的設計與實現；設計並實現了一種動態深度的多維數據樹用於客戶端多維數據的存儲和訪問。
  14. The dfa construction algorithm converts this parse tree into a set of states, as the previous column explains

    如前一篇專欄文章中所解釋的， dfa構造演算法將該解析樹轉換成一組狀態。
  15. Expands the concept of using the scheme language as an executable metalanguage as in the parse tree example for other programming languages

    擴展了將scheme語言用作可執行元語言的概念（如解析樹示例中所示） ，以便其他編程語言利用它。
分享友人
分享到 Line

分享到臉書