{"id":{"repo_id":"mtu","oai_identifier":"oai:digitalcommons.mtu.edu:etdr-3100"},"canonical_url":"https://search.ndltd.org/etd/mtu/oai:digitalcommons.mtu.edu:etdr-3100","repository":{"repo_id":"mtu","name":"Michigan Technological University","base_url":"https://digitalcommons.mtu.edu/do/oai/"},"display":{"title":"FINDING ANTIPATTERNS ACROSS LANGUAGES WITH ABSTRACT SYNTAX TREES","abstract":"Finding antipatterns in student code is a difficult task that is useful for helping beginner programmers. Antipatterns are common mistakes that students make while writing code. Code critiquers are tools that find antipatterns and provide rich, immediate feedback to students, even when professors aren’t available. WebTA is a code critiquer that finds antipatterns using regular expressions (regex), error messages, and language-specific abstract syntax trees (ASTs). Each of these tools has obstacles to antipattern searching that are difficult to overcome. Regex is without context, limiting the patterns it can recognize. Additionally, even experienced users have difficulty reading and debugging regex. Error messages and language-specific abstract syntax trees must be implemented for each language. Error messages are also restricted to finding syntax and other error-related antipatterns. Finally, language-specific abstract syntax trees require rebuilding and redeploying in the current design of WebTA for each new or modified antipattern query. This thesis presents two tools and a collection of antipatterns to solve these issues. The first tool, C-Slam, is a multi-language code critic that uses a combination of AST searching and Python scripts to easily find antipatterns. The second, Universal Abstract Syntax Trees (UASTs), creates a rule-based system for converting ASTs into UASTs. This makes antipatterns that are identical between two languages need only one query to be matched. Finally, this collection of antipatterns is used to show the usefulness of UASTs and provide a starting point for the implementation of future code critiquers.","abstract_html":"Finding antipatterns in student code is a difficult task that is useful for helping beginner programmers. Antipatterns are common mistakes that students make while writing code. Code critiquers are tools that find antipatterns and provide rich, immediate feedback to students, even when professors aren’t available. WebTA is a code critiquer that finds antipatterns using regular expressions (regex), error messages, and language-specific abstract syntax trees (ASTs). Each of these tools has obstacles to antipattern searching that are difficult to overcome. Regex is without context, limiting the patterns it can recognize. Additionally, even experienced users have difficulty reading and debugging regex. Error messages and language-specific abstract syntax trees must be implemented for each language. Error messages are also restricted to finding syntax and other error-related antipatterns. Finally, language-specific abstract syntax trees require rebuilding and redeploying in the current design of WebTA for each new or modified antipattern query. This thesis presents two tools and a collection of antipatterns to solve these issues. The first tool, C-Slam, is a multi-language code critic that uses a combination of AST searching and Python scripts to easily find antipatterns. The second, Universal Abstract Syntax Trees (UASTs), creates a rule-based system for converting ASTs into UASTs. This makes antipatterns that are identical between two languages need only one query to be matched. Finally, this collection of antipatterns is used to show the usefulness of UASTs and provide a starting point for the implementation of future code critiquers.","abstract_has_math":false,"creators":["Masker, Daniel T."],"institution":null,"degree_name":"Master of Science in Computer Science (MS)","degree_level":"Open Access Master's Thesis","degree_discipline":"Department of Computer Science","degree_department":null,"school":null,"contributors":["Leo C. Ureel II"],"advisors":[],"committee_chairs":[],"committee_members":["Laura Brown","Michelle Jarvie-Eggart","Jon Sticklen"],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T08:19:26Z","subjects":["antipattern","code critiquer","tree-sitter","novice code","universal abstract syntax tree","universal dependencies","Programming Languages and Compilers"],"languages":[],"rights":[],"rights_urls":["http://creativecommons.org/licenses/by-nc-sa/4.0/"],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalcommons.mtu.edu/etdr/2026"],"render_values":[{"text":"https://digitalcommons.mtu.edu/etdr/2026","href":"https://digitalcommons.mtu.edu/etdr/2026","code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://doi.org/10.37099/mtu.dc.etdr/2026","outbound_label":"DOI","outbound_source":"dc:identifier","record_url":"https://doi.org/10.37099/mtu.dc.etdr/2026","record_label":"Repository record","record_kind":"doi","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://digitalcommons.mtu.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Adigitalcommons.mtu.edu%3Aetdr-3100","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Leo C. Ureel II"]},{"key":"dc:contributor.committeemember","label":"Committee Member","values":["Laura Brown","Michelle Jarvie-Eggart","Jon Sticklen"]},{"key":"dc:creator","label":"Author","values":["Masker, Daniel T."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.created","label":"Dc Date Created","values":["2025-01-01T08:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Department of Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Open Access Master's Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science in Computer Science (MS)"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["antipattern","code critiquer","tree-sitter","novice code","universal abstract syntax tree","universal dependencies","Programming Languages and Compilers"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights.license","label":"Dc Rights License","values":["http://creativecommons.org/licenses/by-nc-sa/4.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["10.37099/mtu.dc.etdr/2026","https://digitalcommons.mtu.edu/etdr/2026"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Finding antipatterns in student code is a difficult task that is useful for helping beginner programmers. Antipatterns are common mistakes that students make while writing code. Code critiquers are tools that find antipatterns and provide rich, immediate feedback to students, even when professors aren’t available. WebTA is a code critiquer that finds antipatterns using regular expressions (regex), error messages, and language-specific abstract syntax trees (ASTs). Each of these tools has obstacles to antipattern searching that are difficult to overcome. Regex is without context, limiting the patterns it can recognize. Additionally, even experienced users have difficulty reading and debugging regex. Error messages and language-specific abstract syntax trees must be implemented for each language. Error messages are also restricted to finding syntax and other error-related antipatterns. Finally, language-specific abstract syntax trees require rebuilding and redeploying in the current design of WebTA for each new or modified antipattern query. This thesis presents two tools and a collection of antipatterns to solve these issues. The first tool, C-Slam, is a multi-language code critic that uses a combination of AST searching and Python scripts to easily find antipatterns. The second, Universal Abstract Syntax Trees (UASTs), creates a rule-based system for converting ASTs into UASTs. This makes antipatterns that are identical between two languages need only one query to be matched. Finally, this collection of antipatterns is used to show the usefulness of UASTs and provide a starting point for the implementation of future code critiquers."]},{"key":"dc:title","label":"Title","values":["FINDING ANTIPATTERNS ACROSS LANGUAGES WITH ABSTRACT SYNTAX TREES"]}]}],"canonical_facts":{"dc:contributor":["Leo C. Ureel II"],"dc:contributor.committeemember":["Laura Brown","Michelle Jarvie-Eggart","Jon Sticklen"],"dc:creator":["Masker, Daniel T."],"dc:date.created":["2025-01-01T08:00:00Z"],"dc:description.abstract":["Finding antipatterns in student code is a difficult task that is useful for helping beginner programmers. Antipatterns are common mistakes that students make while writing code. Code critiquers are tools that find antipatterns and provide rich, immediate feedback to students, even when professors aren’t available. WebTA is a code critiquer that finds antipatterns using regular expressions (regex), error messages, and language-specific abstract syntax trees (ASTs). Each of these tools has obstacles to antipattern searching that are difficult to overcome. Regex is without context, limiting the patterns it can recognize. Additionally, even experienced users have difficulty reading and debugging regex. Error messages and language-specific abstract syntax trees must be implemented for each language. Error messages are also restricted to finding syntax and other error-related antipatterns. Finally, language-specific abstract syntax trees require rebuilding and redeploying in the current design of WebTA for each new or modified antipattern query. This thesis presents two tools and a collection of antipatterns to solve these issues. The first tool, C-Slam, is a multi-language code critic that uses a combination of AST searching and Python scripts to easily find antipatterns. The second, Universal Abstract Syntax Trees (UASTs), creates a rule-based system for converting ASTs into UASTs. This makes antipatterns that are identical between two languages need only one query to be matched. Finally, this collection of antipatterns is used to show the usefulness of UASTs and provide a starting point for the implementation of future code critiquers."],"dc:identifier":["10.37099/mtu.dc.etdr/2026","https://digitalcommons.mtu.edu/etdr/2026"],"dc:rights.license":["http://creativecommons.org/licenses/by-nc-sa/4.0/"],"dc:subject":["antipattern","code critiquer","tree-sitter","novice code","universal abstract syntax tree","universal dependencies","Programming Languages and Compilers"],"dc:title":["FINDING ANTIPATTERNS ACROSS LANGUAGES WITH ABSTRACT SYNTAX TREES"],"thesis:degree_discipline":["Department of Computer Science"],"thesis:degree_level":["Open Access Master's Thesis"],"thesis:degree_name":["Master of Science in Computer Science (MS)"]},"updated_at":"2026-11-19T08:19:26Z"}