Automatic Grading for Complex Multifile Programs
This paper presents an automatic grading method DGRADER, which handles complex multifile programs. Both the dynamic and the static grading support multifile program analysis. So, it can be an advantage to handle complex programming problem which requires more than one program file. Dynamic analysis...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2020-01-01
|
| Series: | Complexity |
| Online Access: | http://dx.doi.org/10.1155/2020/3279053 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850238022775209984 |
|---|---|
| author | Tiantian Wang Djoko Budi Santoso Kechao Wang Xiaohong Su |
| author_facet | Tiantian Wang Djoko Budi Santoso Kechao Wang Xiaohong Su |
| author_sort | Tiantian Wang |
| collection | DOAJ |
| description | This paper presents an automatic grading method DGRADER, which handles complex multifile programs. Both the dynamic and the static grading support multifile program analysis. So, it can be an advantage to handle complex programming problem which requires more than one program file. Dynamic analysis takes advantage of object file linker in compilation to link complex multifile program. The static grading module consists of the following steps. Firstly, the program is parsed into abstract syntax tree, which is mapped into abstract syntax tree data map. Then, the information of preprocessor is used for linking external sources called in main program by complex multifile program linker-fusion algorithm. Next, standardization process is performed for problematic code removal, unused function removal, and function sequence ordering based on function call. Finally, program matching successfully tackles structure variance problem by previous standardization process and by simple tree matching using tag classifier. The novelty of the approach is that it handles complex multifile program analysis with flexible grading with consideration of modularity and big scale of programming problem complexity. The results have shown improvement in grading precision which gives reliable grading score delivered with intuitive system. |
| format | Article |
| id | doaj-art-07b94e40dc8d4ba0828de55ee83c4c98 |
| institution | OA Journals |
| issn | 1076-2787 1099-0526 |
| language | English |
| publishDate | 2020-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Complexity |
| spelling | doaj-art-07b94e40dc8d4ba0828de55ee83c4c982025-08-20T02:01:35ZengWileyComplexity1076-27871099-05262020-01-01202010.1155/2020/32790533279053Automatic Grading for Complex Multifile ProgramsTiantian Wang0Djoko Budi Santoso1Kechao Wang2Xiaohong Su3School of Computer Science and Technology, Harbin Institute of Technology, Harbin 150001, ChinaSchool of Computer Science and Technology, Harbin Institute of Technology, Harbin 150001, ChinaSchool of Information Engineering, Harbin University, Harbin 150001, ChinaSchool of Computer Science and Technology, Harbin Institute of Technology, Harbin 150001, ChinaThis paper presents an automatic grading method DGRADER, which handles complex multifile programs. Both the dynamic and the static grading support multifile program analysis. So, it can be an advantage to handle complex programming problem which requires more than one program file. Dynamic analysis takes advantage of object file linker in compilation to link complex multifile program. The static grading module consists of the following steps. Firstly, the program is parsed into abstract syntax tree, which is mapped into abstract syntax tree data map. Then, the information of preprocessor is used for linking external sources called in main program by complex multifile program linker-fusion algorithm. Next, standardization process is performed for problematic code removal, unused function removal, and function sequence ordering based on function call. Finally, program matching successfully tackles structure variance problem by previous standardization process and by simple tree matching using tag classifier. The novelty of the approach is that it handles complex multifile program analysis with flexible grading with consideration of modularity and big scale of programming problem complexity. The results have shown improvement in grading precision which gives reliable grading score delivered with intuitive system.http://dx.doi.org/10.1155/2020/3279053 |
| spellingShingle | Tiantian Wang Djoko Budi Santoso Kechao Wang Xiaohong Su Automatic Grading for Complex Multifile Programs Complexity |
| title | Automatic Grading for Complex Multifile Programs |
| title_full | Automatic Grading for Complex Multifile Programs |
| title_fullStr | Automatic Grading for Complex Multifile Programs |
| title_full_unstemmed | Automatic Grading for Complex Multifile Programs |
| title_short | Automatic Grading for Complex Multifile Programs |
| title_sort | automatic grading for complex multifile programs |
| url | http://dx.doi.org/10.1155/2020/3279053 |
| work_keys_str_mv | AT tiantianwang automaticgradingforcomplexmultifileprograms AT djokobudisantoso automaticgradingforcomplexmultifileprograms AT kechaowang automaticgradingforcomplexmultifileprograms AT xiaohongsu automaticgradingforcomplexmultifileprograms |