Exploring the Trade-Off between Language Simplicity and Execution Efficiency: A Study Using Crython and LLVM Article Swipe
YOU?
·
· 2025
· Open Access
·
· DOI: https://doi.org/10.32628/cseit25113379
Contemporary programming languages often pose a challenge due to either complex syntax or performance limitations, especially in dynamically typed environments. The language proposed in this paper, Crython, aims to mitigate these challenges by offering a beginner-friendly, Python-like syntax combined with performance that approaches that of C. It is built with a custom lexer, employs a Pratt parser for expression handling, and uses a Recursive Descent parser for statements. Code generation is powered by LLVM, leveraging its robust toolchain to simplify backend implementation and deliver high execution speed. While the syntax is intentionally similar to Python to facilitate ease of adoption, it also addresses certain ambiguities and inconsistencies found in Python’s design. The paper includes performance benchmarks across multiple languages to demonstrate the efficiency and competitiveness of the proposed language.
Related Topics
- Type
- article
- Language
- en
- Landing Page
- https://doi.org/10.32628/cseit25113379
- https://www.ijsrcseit.com/index.php/home/article/download/CSEIT25113379/CSEIT25113379
- OA Status
- diamond
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W4411370507
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W4411370507Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.32628/cseit25113379Digital Object Identifier
- Title
-
Exploring the Trade-Off between Language Simplicity and Execution Efficiency: A Study Using Crython and LLVMWork title
- Type
-
articleOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2025Year of publication
- Publication date
-
2025-06-15Full publication date if available
- Authors
-
Soham Malakar, Sreekanya Pal, Norazeani Abdul Rahman, Asoke NathList of authors in order
- Landing page
-
https://doi.org/10.32628/cseit25113379Publisher landing page
- PDF URL
-
https://www.ijsrcseit.com/index.php/home/article/download/CSEIT25113379/CSEIT25113379Direct link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
diamondOpen access status per OpenAlex
- OA URL
-
https://www.ijsrcseit.com/index.php/home/article/download/CSEIT25113379/CSEIT25113379Direct OA link when available
- Concepts
-
Simplicity, Computer science, Parallel computing, Philosophy, EpistemologyTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
0Total citation count in OpenAlex
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W4411370507 |
|---|---|
| doi | https://doi.org/10.32628/cseit25113379 |
| ids.doi | https://doi.org/10.32628/cseit25113379 |
| ids.openalex | https://openalex.org/W4411370507 |
| fwci | 0.0 |
| type | article |
| title | Exploring the Trade-Off between Language Simplicity and Execution Efficiency: A Study Using Crython and LLVM |
| biblio.issue | 3 |
| biblio.volume | 11 |
| biblio.last_page | 973 |
| biblio.first_page | 965 |
| topics[0].id | https://openalex.org/T10181 |
| topics[0].field.id | https://openalex.org/fields/17 |
| topics[0].field.display_name | Computer Science |
| topics[0].score | 0.3711000084877014 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/1702 |
| topics[0].subfield.display_name | Artificial Intelligence |
| topics[0].display_name | Natural Language Processing Techniques |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C2776372474 |
| concepts[0].level | 2 |
| concepts[0].score | 0.8710451126098633 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q508291 |
| concepts[0].display_name | Simplicity |
| concepts[1].id | https://openalex.org/C41008148 |
| concepts[1].level | 0 |
| concepts[1].score | 0.6429768800735474 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[1].display_name | Computer science |
| concepts[2].id | https://openalex.org/C173608175 |
| concepts[2].level | 1 |
| concepts[2].score | 0.3227692246437073 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q232661 |
| concepts[2].display_name | Parallel computing |
| concepts[3].id | https://openalex.org/C138885662 |
| concepts[3].level | 0 |
| concepts[3].score | 0.06074005365371704 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q5891 |
| concepts[3].display_name | Philosophy |
| concepts[4].id | https://openalex.org/C111472728 |
| concepts[4].level | 1 |
| concepts[4].score | 0.0 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q9471 |
| concepts[4].display_name | Epistemology |
| keywords[0].id | https://openalex.org/keywords/simplicity |
| keywords[0].score | 0.8710451126098633 |
| keywords[0].display_name | Simplicity |
| keywords[1].id | https://openalex.org/keywords/computer-science |
| keywords[1].score | 0.6429768800735474 |
| keywords[1].display_name | Computer science |
| keywords[2].id | https://openalex.org/keywords/parallel-computing |
| keywords[2].score | 0.3227692246437073 |
| keywords[2].display_name | Parallel computing |
| keywords[3].id | https://openalex.org/keywords/philosophy |
| keywords[3].score | 0.06074005365371704 |
| keywords[3].display_name | Philosophy |
| language | en |
| locations[0].id | doi:10.32628/cseit25113379 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S4210200847 |
| locations[0].source.issn | 2456-3307 |
| locations[0].source.type | journal |
| locations[0].source.is_oa | True |
| locations[0].source.issn_l | 2456-3307 |
| locations[0].source.is_core | False |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | International Journal of Scientific Research in Computer Science Engineering and Information Technology |
| locations[0].source.host_organization | |
| locations[0].source.host_organization_name | |
| locations[0].license | cc-by |
| locations[0].pdf_url | https://www.ijsrcseit.com/index.php/home/article/download/CSEIT25113379/CSEIT25113379 |
| locations[0].version | publishedVersion |
| locations[0].raw_type | journal-article |
| locations[0].license_id | https://openalex.org/licenses/cc-by |
| locations[0].is_accepted | True |
| locations[0].is_published | True |
| locations[0].raw_source_name | International Journal of Scientific Research in Computer Science, Engineering and Information Technology |
| locations[0].landing_page_url | https://doi.org/10.32628/cseit25113379 |
| indexed_in | crossref |
| authorships[0].author.id | https://openalex.org/A5118324759 |
| authorships[0].author.orcid | |
| authorships[0].author.display_name | Soham Malakar |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | None Soham Malakar |
| authorships[0].is_corresponding | False |
| authorships[1].author.id | https://openalex.org/A5001972822 |
| authorships[1].author.orcid | |
| authorships[1].author.display_name | Sreekanya Pal |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | None Sreekanya Pal |
| authorships[1].is_corresponding | False |
| authorships[2].author.id | https://openalex.org/A5100687546 |
| authorships[2].author.orcid | https://orcid.org/0000-0001-7553-8890 |
| authorships[2].author.display_name | Norazeani Abdul Rahman |
| authorships[2].author_position | middle |
| authorships[2].raw_author_name | None Nazlee Rahman |
| authorships[2].is_corresponding | False |
| authorships[3].author.id | https://openalex.org/A5112041541 |
| authorships[3].author.orcid | https://orcid.org/0009-0006-7239-5103 |
| authorships[3].author.display_name | Asoke Nath |
| authorships[3].author_position | last |
| authorships[3].raw_author_name | None Asoke Nath |
| authorships[3].is_corresponding | False |
| has_content.pdf | True |
| has_content.grobid_xml | True |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://www.ijsrcseit.com/index.php/home/article/download/CSEIT25113379/CSEIT25113379 |
| open_access.oa_status | diamond |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Exploring the Trade-Off between Language Simplicity and Execution Efficiency: A Study Using Crython and LLVM |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-11-06T03:46:38.306776 |
| primary_topic.id | https://openalex.org/T10181 |
| primary_topic.field.id | https://openalex.org/fields/17 |
| primary_topic.field.display_name | Computer Science |
| primary_topic.score | 0.3711000084877014 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/1702 |
| primary_topic.subfield.display_name | Artificial Intelligence |
| primary_topic.display_name | Natural Language Processing Techniques |
| related_works | https://openalex.org/W4391375266, https://openalex.org/W2899084033, https://openalex.org/W2748952813, https://openalex.org/W2368019753, https://openalex.org/W2333930193, https://openalex.org/W2737356002, https://openalex.org/W2246241526, https://openalex.org/W4301122218, https://openalex.org/W2374150061, https://openalex.org/W2081340182 |
| cited_by_count | 0 |
| locations_count | 1 |
| best_oa_location.id | doi:10.32628/cseit25113379 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4210200847 |
| best_oa_location.source.issn | 2456-3307 |
| best_oa_location.source.type | journal |
| best_oa_location.source.is_oa | True |
| best_oa_location.source.issn_l | 2456-3307 |
| best_oa_location.source.is_core | False |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | International Journal of Scientific Research in Computer Science Engineering and Information Technology |
| best_oa_location.source.host_organization | |
| best_oa_location.source.host_organization_name | |
| best_oa_location.license | cc-by |
| best_oa_location.pdf_url | https://www.ijsrcseit.com/index.php/home/article/download/CSEIT25113379/CSEIT25113379 |
| best_oa_location.version | publishedVersion |
| best_oa_location.raw_type | journal-article |
| best_oa_location.license_id | https://openalex.org/licenses/cc-by |
| best_oa_location.is_accepted | True |
| best_oa_location.is_published | True |
| best_oa_location.raw_source_name | International Journal of Scientific Research in Computer Science, Engineering and Information Technology |
| best_oa_location.landing_page_url | https://doi.org/10.32628/cseit25113379 |
| primary_location.id | doi:10.32628/cseit25113379 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S4210200847 |
| primary_location.source.issn | 2456-3307 |
| primary_location.source.type | journal |
| primary_location.source.is_oa | True |
| primary_location.source.issn_l | 2456-3307 |
| primary_location.source.is_core | False |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | International Journal of Scientific Research in Computer Science Engineering and Information Technology |
| primary_location.source.host_organization | |
| primary_location.source.host_organization_name | |
| primary_location.license | cc-by |
| primary_location.pdf_url | https://www.ijsrcseit.com/index.php/home/article/download/CSEIT25113379/CSEIT25113379 |
| primary_location.version | publishedVersion |
| primary_location.raw_type | journal-article |
| primary_location.license_id | https://openalex.org/licenses/cc-by |
| primary_location.is_accepted | True |
| primary_location.is_published | True |
| primary_location.raw_source_name | International Journal of Scientific Research in Computer Science, Engineering and Information Technology |
| primary_location.landing_page_url | https://doi.org/10.32628/cseit25113379 |
| publication_date | 2025-06-15 |
| publication_year | 2025 |
| referenced_works_count | 0 |
| abstract_inverted_index.a | 5, 34, 50, 54, 62 |
| abstract_inverted_index.C. | 45 |
| abstract_inverted_index.It | 46 |
| abstract_inverted_index.by | 32, 72 |
| abstract_inverted_index.in | 16, 23, 108 |
| abstract_inverted_index.is | 47, 70, 90 |
| abstract_inverted_index.it | 100 |
| abstract_inverted_index.of | 44, 98, 125 |
| abstract_inverted_index.or | 12 |
| abstract_inverted_index.to | 8, 28, 78, 93, 95, 119 |
| abstract_inverted_index.The | 20, 111 |
| abstract_inverted_index.and | 60, 82, 105, 123 |
| abstract_inverted_index.due | 7 |
| abstract_inverted_index.for | 57, 66 |
| abstract_inverted_index.its | 75 |
| abstract_inverted_index.the | 88, 121, 126 |
| abstract_inverted_index.Code | 68 |
| abstract_inverted_index.aims | 27 |
| abstract_inverted_index.also | 101 |
| abstract_inverted_index.ease | 97 |
| abstract_inverted_index.high | 84 |
| abstract_inverted_index.pose | 4 |
| abstract_inverted_index.that | 41, 43 |
| abstract_inverted_index.this | 24 |
| abstract_inverted_index.uses | 61 |
| abstract_inverted_index.with | 39, 49 |
| abstract_inverted_index.LLVM, | 73 |
| abstract_inverted_index.Pratt | 55 |
| abstract_inverted_index.While | 87 |
| abstract_inverted_index.built | 48 |
| abstract_inverted_index.found | 107 |
| abstract_inverted_index.often | 3 |
| abstract_inverted_index.paper | 112 |
| abstract_inverted_index.these | 30 |
| abstract_inverted_index.typed | 18 |
| abstract_inverted_index.Python | 94 |
| abstract_inverted_index.across | 116 |
| abstract_inverted_index.custom | 51 |
| abstract_inverted_index.either | 9 |
| abstract_inverted_index.lexer, | 52 |
| abstract_inverted_index.paper, | 25 |
| abstract_inverted_index.parser | 56, 65 |
| abstract_inverted_index.robust | 76 |
| abstract_inverted_index.speed. | 86 |
| abstract_inverted_index.syntax | 11, 37, 89 |
| abstract_inverted_index.Descent | 64 |
| abstract_inverted_index.backend | 80 |
| abstract_inverted_index.certain | 103 |
| abstract_inverted_index.complex | 10 |
| abstract_inverted_index.deliver | 83 |
| abstract_inverted_index.design. | 110 |
| abstract_inverted_index.employs | 53 |
| abstract_inverted_index.powered | 71 |
| abstract_inverted_index.similar | 92 |
| abstract_inverted_index.Crython, | 26 |
| abstract_inverted_index.combined | 38 |
| abstract_inverted_index.includes | 113 |
| abstract_inverted_index.language | 21 |
| abstract_inverted_index.mitigate | 29 |
| abstract_inverted_index.multiple | 117 |
| abstract_inverted_index.offering | 33 |
| abstract_inverted_index.proposed | 22, 127 |
| abstract_inverted_index.simplify | 79 |
| abstract_inverted_index.Recursive | 63 |
| abstract_inverted_index.addresses | 102 |
| abstract_inverted_index.adoption, | 99 |
| abstract_inverted_index.challenge | 6 |
| abstract_inverted_index.execution | 85 |
| abstract_inverted_index.handling, | 59 |
| abstract_inverted_index.language. | 128 |
| abstract_inverted_index.languages | 2, 118 |
| abstract_inverted_index.toolchain | 77 |
| abstract_inverted_index.Python’s | 109 |
| abstract_inverted_index.approaches | 42 |
| abstract_inverted_index.benchmarks | 115 |
| abstract_inverted_index.challenges | 31 |
| abstract_inverted_index.efficiency | 122 |
| abstract_inverted_index.especially | 15 |
| abstract_inverted_index.expression | 58 |
| abstract_inverted_index.facilitate | 96 |
| abstract_inverted_index.generation | 69 |
| abstract_inverted_index.leveraging | 74 |
| abstract_inverted_index.Python-like | 36 |
| abstract_inverted_index.ambiguities | 104 |
| abstract_inverted_index.demonstrate | 120 |
| abstract_inverted_index.dynamically | 17 |
| abstract_inverted_index.performance | 13, 40, 114 |
| abstract_inverted_index.programming | 1 |
| abstract_inverted_index.statements. | 67 |
| abstract_inverted_index.Contemporary | 0 |
| abstract_inverted_index.limitations, | 14 |
| abstract_inverted_index.environments. | 19 |
| abstract_inverted_index.intentionally | 91 |
| abstract_inverted_index.implementation | 81 |
| abstract_inverted_index.competitiveness | 124 |
| abstract_inverted_index.inconsistencies | 106 |
| abstract_inverted_index.beginner-friendly, | 35 |
| cited_by_percentile_year | |
| countries_distinct_count | 0 |
| institutions_distinct_count | 4 |
| citation_normalized_percentile.value | 0.10062316 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | True |