ComVIS—Interactive simulation environment for compiler learning
Simulation‐based learning tools have become commonly used at all levels of education. They are recognized as an effective means of studying complex and systems. In traditional teaching of compiler concepts, students are incapable of visualizing theoretical constructions, while the use of simulation...
Gespeichert in:
Veröffentlicht in: | Computer applications in engineering education 2022-01, Vol.30 (1), p.275-291, Article cae.22456 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 291 |
---|---|
container_issue | 1 |
container_start_page | 275 |
container_title | Computer applications in engineering education |
container_volume | 30 |
creator | Jovanović, Nenad Stamenković, Srećko Miljković, Dragiša Chakraborty, Pinaki |
description | Simulation‐based learning tools have become commonly used at all levels of education. They are recognized as an effective means of studying complex and systems. In traditional teaching of compiler concepts, students are incapable of visualizing theoretical constructions, while the use of simulation systems represents an excellent blend of theoretical and practical experience. This paper describes a software system for visualization and simulation of basic compiler concepts and algorithms. The simulation tool enables students to visualize the operation of finite automata, convert a regular expression into deterministic finite automata (DFA) or nondeterministic finite automata, and simulate Thompson's construction algorithm. The process of constructing the LL(0) and LR(1) parsing tables is represented as a step‐by‐step simulation, with the user receives feedback on the correctness of each step before moving on to the next. The system is capable of calculating the FIRST and FOLLOW sets, graphically representing DFA, and constructing the corresponding parsing table. This tool provides a module for visualizing the process of machine code generation. |
doi_str_mv | 10.1002/cae.22456 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2619391957</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2619391957</sourcerecordid><originalsourceid>FETCH-LOGICAL-c2976-93d766846f13533c0a0e1316cbed407a7a931c567b9e5e7c5a3b89dacc8d87ac3</originalsourceid><addsrcrecordid>eNp1kL1OwzAURi0EEqUw8AaRmBjS2nFsx2MVFYhUiYGf1XKdG-QqsYudFnXjIXhCnoSUsDLdbzj3froHoWuCZwTjbG40zLIsZ_wETQiWMsUsz06PmZOUCkHP0UWMG4yx5FRO0KL03Wv19P35Vbkegja93UMSbbdrdW-9S8DtbfCuA9cnjQ-J8d3WthCSFnRw1r1dorNGtxGu_uYUvdwtn8uHdPV4X5WLVWoyKXgqaS04L3LeEMooNVhjIJRws4Y6x0ILLSkxjIu1BAbCME3Xhay1MUVdCG3oFN2Md7fBv-8g9mrjd8ENlSrjRFJJJBMDdTtSJvgYAzRqG2ynw0ERrI6G1GBI_Roa2PnIfgwPHf4HVblYjhs_iQ9oRw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2619391957</pqid></control><display><type>article</type><title>ComVIS—Interactive simulation environment for compiler learning</title><source>Wiley Online Library All Journals</source><creator>Jovanović, Nenad ; Stamenković, Srećko ; Miljković, Dragiša ; Chakraborty, Pinaki</creator><creatorcontrib>Jovanović, Nenad ; Stamenković, Srećko ; Miljković, Dragiša ; Chakraborty, Pinaki</creatorcontrib><description>Simulation‐based learning tools have become commonly used at all levels of education. They are recognized as an effective means of studying complex and systems. In traditional teaching of compiler concepts, students are incapable of visualizing theoretical constructions, while the use of simulation systems represents an excellent blend of theoretical and practical experience. This paper describes a software system for visualization and simulation of basic compiler concepts and algorithms. The simulation tool enables students to visualize the operation of finite automata, convert a regular expression into deterministic finite automata (DFA) or nondeterministic finite automata, and simulate Thompson's construction algorithm. The process of constructing the LL(0) and LR(1) parsing tables is represented as a step‐by‐step simulation, with the user receives feedback on the correctness of each step before moving on to the next. The system is capable of calculating the FIRST and FOLLOW sets, graphically representing DFA, and constructing the corresponding parsing table. This tool provides a module for visualizing the process of machine code generation.</description><identifier>ISSN: 1061-3773</identifier><identifier>EISSN: 1099-0542</identifier><identifier>DOI: 10.1002/cae.22456</identifier><language>eng</language><publisher>Hoboken: Wiley Subscription Services, Inc</publisher><subject>Algorithms ; Automata theory ; compiler ; Compilers ; Graphical representations ; interactive environment ; Learning ; Simulation ; Students ; System effectiveness</subject><ispartof>Computer applications in engineering education, 2022-01, Vol.30 (1), p.275-291, Article cae.22456</ispartof><rights>2021 Wiley Periodicals LLC</rights><rights>2022 Wiley Periodicals LLC</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c2976-93d766846f13533c0a0e1316cbed407a7a931c567b9e5e7c5a3b89dacc8d87ac3</citedby><cites>FETCH-LOGICAL-c2976-93d766846f13533c0a0e1316cbed407a7a931c567b9e5e7c5a3b89dacc8d87ac3</cites><orcidid>0000-0002-2010-8022 ; 0000-0002-0933-4379 ; 0000-0002-8872-7516</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://onlinelibrary.wiley.com/doi/pdf/10.1002%2Fcae.22456$$EPDF$$P50$$Gwiley$$H</linktopdf><linktohtml>$$Uhttps://onlinelibrary.wiley.com/doi/full/10.1002%2Fcae.22456$$EHTML$$P50$$Gwiley$$H</linktohtml><link.rule.ids>314,780,784,1416,27923,27924,45573,45574</link.rule.ids></links><search><creatorcontrib>Jovanović, Nenad</creatorcontrib><creatorcontrib>Stamenković, Srećko</creatorcontrib><creatorcontrib>Miljković, Dragiša</creatorcontrib><creatorcontrib>Chakraborty, Pinaki</creatorcontrib><title>ComVIS—Interactive simulation environment for compiler learning</title><title>Computer applications in engineering education</title><description>Simulation‐based learning tools have become commonly used at all levels of education. They are recognized as an effective means of studying complex and systems. In traditional teaching of compiler concepts, students are incapable of visualizing theoretical constructions, while the use of simulation systems represents an excellent blend of theoretical and practical experience. This paper describes a software system for visualization and simulation of basic compiler concepts and algorithms. The simulation tool enables students to visualize the operation of finite automata, convert a regular expression into deterministic finite automata (DFA) or nondeterministic finite automata, and simulate Thompson's construction algorithm. The process of constructing the LL(0) and LR(1) parsing tables is represented as a step‐by‐step simulation, with the user receives feedback on the correctness of each step before moving on to the next. The system is capable of calculating the FIRST and FOLLOW sets, graphically representing DFA, and constructing the corresponding parsing table. This tool provides a module for visualizing the process of machine code generation.</description><subject>Algorithms</subject><subject>Automata theory</subject><subject>compiler</subject><subject>Compilers</subject><subject>Graphical representations</subject><subject>interactive environment</subject><subject>Learning</subject><subject>Simulation</subject><subject>Students</subject><subject>System effectiveness</subject><issn>1061-3773</issn><issn>1099-0542</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><recordid>eNp1kL1OwzAURi0EEqUw8AaRmBjS2nFsx2MVFYhUiYGf1XKdG-QqsYudFnXjIXhCnoSUsDLdbzj3froHoWuCZwTjbG40zLIsZ_wETQiWMsUsz06PmZOUCkHP0UWMG4yx5FRO0KL03Wv19P35Vbkegja93UMSbbdrdW-9S8DtbfCuA9cnjQ-J8d3WthCSFnRw1r1dorNGtxGu_uYUvdwtn8uHdPV4X5WLVWoyKXgqaS04L3LeEMooNVhjIJRws4Y6x0ILLSkxjIu1BAbCME3Xhay1MUVdCG3oFN2Md7fBv-8g9mrjd8ENlSrjRFJJJBMDdTtSJvgYAzRqG2ynw0ERrI6G1GBI_Roa2PnIfgwPHf4HVblYjhs_iQ9oRw</recordid><startdate>202201</startdate><enddate>202201</enddate><creator>Jovanović, Nenad</creator><creator>Stamenković, Srećko</creator><creator>Miljković, Dragiša</creator><creator>Chakraborty, Pinaki</creator><general>Wiley Subscription Services, Inc</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>JQ2</scope><scope>KR7</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><orcidid>https://orcid.org/0000-0002-2010-8022</orcidid><orcidid>https://orcid.org/0000-0002-0933-4379</orcidid><orcidid>https://orcid.org/0000-0002-8872-7516</orcidid></search><sort><creationdate>202201</creationdate><title>ComVIS—Interactive simulation environment for compiler learning</title><author>Jovanović, Nenad ; Stamenković, Srećko ; Miljković, Dragiša ; Chakraborty, Pinaki</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c2976-93d766846f13533c0a0e1316cbed407a7a931c567b9e5e7c5a3b89dacc8d87ac3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Algorithms</topic><topic>Automata theory</topic><topic>compiler</topic><topic>Compilers</topic><topic>Graphical representations</topic><topic>interactive environment</topic><topic>Learning</topic><topic>Simulation</topic><topic>Students</topic><topic>System effectiveness</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Jovanović, Nenad</creatorcontrib><creatorcontrib>Stamenković, Srećko</creatorcontrib><creatorcontrib>Miljković, Dragiša</creatorcontrib><creatorcontrib>Chakraborty, Pinaki</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Civil Engineering Abstracts</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Computer applications in engineering education</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Jovanović, Nenad</au><au>Stamenković, Srećko</au><au>Miljković, Dragiša</au><au>Chakraborty, Pinaki</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>ComVIS—Interactive simulation environment for compiler learning</atitle><jtitle>Computer applications in engineering education</jtitle><date>2022-01</date><risdate>2022</risdate><volume>30</volume><issue>1</issue><spage>275</spage><epage>291</epage><pages>275-291</pages><artnum>cae.22456</artnum><issn>1061-3773</issn><eissn>1099-0542</eissn><abstract>Simulation‐based learning tools have become commonly used at all levels of education. They are recognized as an effective means of studying complex and systems. In traditional teaching of compiler concepts, students are incapable of visualizing theoretical constructions, while the use of simulation systems represents an excellent blend of theoretical and practical experience. This paper describes a software system for visualization and simulation of basic compiler concepts and algorithms. The simulation tool enables students to visualize the operation of finite automata, convert a regular expression into deterministic finite automata (DFA) or nondeterministic finite automata, and simulate Thompson's construction algorithm. The process of constructing the LL(0) and LR(1) parsing tables is represented as a step‐by‐step simulation, with the user receives feedback on the correctness of each step before moving on to the next. The system is capable of calculating the FIRST and FOLLOW sets, graphically representing DFA, and constructing the corresponding parsing table. This tool provides a module for visualizing the process of machine code generation.</abstract><cop>Hoboken</cop><pub>Wiley Subscription Services, Inc</pub><doi>10.1002/cae.22456</doi><tpages>17</tpages><orcidid>https://orcid.org/0000-0002-2010-8022</orcidid><orcidid>https://orcid.org/0000-0002-0933-4379</orcidid><orcidid>https://orcid.org/0000-0002-8872-7516</orcidid></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1061-3773 |
ispartof | Computer applications in engineering education, 2022-01, Vol.30 (1), p.275-291, Article cae.22456 |
issn | 1061-3773 1099-0542 |
language | eng |
recordid | cdi_proquest_journals_2619391957 |
source | Wiley Online Library All Journals |
subjects | Algorithms Automata theory compiler Compilers Graphical representations interactive environment Learning Simulation Students System effectiveness |
title | ComVIS—Interactive simulation environment for compiler learning |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-13T07%3A52%3A37IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=ComVIS%E2%80%94Interactive%20simulation%20environment%20for%20compiler%20learning&rft.jtitle=Computer%20applications%20in%20engineering%20education&rft.au=Jovanovi%C4%87,%20Nenad&rft.date=2022-01&rft.volume=30&rft.issue=1&rft.spage=275&rft.epage=291&rft.pages=275-291&rft.artnum=cae.22456&rft.issn=1061-3773&rft.eissn=1099-0542&rft_id=info:doi/10.1002/cae.22456&rft_dat=%3Cproquest_cross%3E2619391957%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2619391957&rft_id=info:pmid/&rfr_iscdi=true |