| DC 欄位 |
值 |
語言 |
| DC.contributor | 資訊工程學系 | zh_TW |
| DC.creator | 蔡家豪 | zh_TW |
| DC.creator | Jia-Hao Cai | en_US |
| dc.date.accessioned | 2021-7-20T07:39:07Z | |
| dc.date.available | 2021-7-20T07:39:07Z | |
| dc.date.issued | 2021 | |
| dc.identifier.uri | http://ir.lib.ncu.edu.tw:88/thesis/view_etd.asp?URN=107522019 | |
| dc.contributor.department | 資訊工程學系 | zh_TW |
| DC.description | 國立中央大學 | zh_TW |
| DC.description | National Central University | en_US |
| dc.description.abstract | 程式碼的好壞可以從很多面向來分析。學習者可以從這些評分指標中，學習如何撰寫更好的程式碼。評分者也能藉由評分工具來對程式碼進行程式功能正確與否以外的評價。其中，時間複雜度是評價程式碼好壞與否的重要指標。但分析程式碼的時間複雜度並不是簡單的事。
本研究實作一個基於抽象語法樹分析的程式碼時間複雜度靜態分析工具－－RecTCC。現有的基於抽象語法樹分析的工具，因為能獲得的資訊不足，對於遞迴函式的支援性不佳。RecTCC利用Value Numbering的概念及符號表來追蹤函式參數，找出參數與引數之間的值的變化，並以此來當作遞迴呼叫的工作量變化。Big-O AST會在AST上記錄各節點的時間複雜度，走訪Big-O AST並計算循序、選擇、重覆結構的時間複雜度，可找出非遞迴呼叫部份的部份時間複雜度。由以上步驟可以得到遞迴關係式，再搭配Master Theorem來分析遞迴函式的時間複雜度。
本研究將Introduction of Algorithms一書中的演算法分成三類：Loop、If-Else、Recursion，並從各類中挑選演算法來實作並進行評估。與其他工具相比，只有RecTCC對這三類演算法皆有支援。 | zh_TW |
| dc.description.abstract | There are several aspects to judge the quality of a source code. Students can learn how to write a better code from these evaluation features. Teachers can evaluate the source code besides the correctness of programs. In these evaluation features, the time complexity is an important feature. However, finding the time complexity of a source code is difficult.
In this paper, we implement a static time complexity analysis tool based on AST analysis, called RecTCC. Because of the lack of some information, present analysis tools based on AST analysis are not compatible with recursive functions. RecTCC uses the concept of Value Numbering and symbol tables to chase the function parameters. We take the variations between parameters and arguments as the workload variation of the recursive calls. RecTCC uses Big-O AST to find the time complexities comprised of the non-recursive call parts. Finally, RecTCC can find the time complexities of recursive functions by recurrence relations and the master theorem.
In this paper, we separate algorithms in ＂Introduction of Algorithms＂ into three categories: Loop, If-Else, Recursion. We implement some algorithms from these categories, and use them to test analysis tools. RecTCC is the only tool compatible with all algorithms in these three categories. | en_US |
| DC.subject | 時間複雜度 | zh_TW |
| DC.subject | 遞迴函式 | zh_TW |
| DC.subject | 靜態程式分析 | zh_TW |
| DC.subject | 抽象語法樹分析 | zh_TW |
| DC.subject | Time complexity | en_US |
| DC.subject | Recursive function | en_US |
| DC.subject | Static program analysis | en_US |
| DC.subject | Abstract syntax tree analysis | en_US |
| DC.title | 教學用靜態時間複雜度分析工具 | zh_TW |
| dc.language.iso | zh-TW | zh-TW |
| DC.title | A Static Time Complexity Analysis Tool for Education | en_US |
| DC.type | 博碩士論文 | zh_TW |
| DC.type | thesis | en_US |
| DC.publisher | National Central University | en_US |