{"id":18438820,"url":"https://github.com/youseftareq33/java_compiler_1_modula-2_syntaxcheck","last_synced_at":"2026-04-29T09:33:52.880Z","repository":{"id":287882260,"uuid":"830204808","full_name":"youseftareq33/Java_Compiler_1_MODULA-2_SyntaxCheck","owner":"youseftareq33","description":"Check Syntax Of MODULA-2 Programming Language Using LL(1) Predictive Parser","archived":false,"fork":false,"pushed_at":"2024-07-18T17:38:40.000Z","size":368,"stargazers_count":0,"open_issues_count":0,"forks_count":1,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-06-02T01:41:55.029Z","etag":null,"topics":["compiler","java","javafx","ll1-parser","modula2"],"latest_commit_sha":null,"homepage":"","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/youseftareq33.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null}},"created_at":"2024-07-17T20:06:06.000Z","updated_at":"2025-02-20T17:43:41.000Z","dependencies_parsed_at":"2025-04-14T13:26:06.644Z","dependency_job_id":null,"html_url":"https://github.com/youseftareq33/Java_Compiler_1_MODULA-2_SyntaxCheck","commit_stats":null,"previous_names":["youseftareq33/java_compiler_1_modula-2_syntaxcheck"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/youseftareq33/Java_Compiler_1_MODULA-2_SyntaxCheck","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/youseftareq33%2FJava_Compiler_1_MODULA-2_SyntaxCheck","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/youseftareq33%2FJava_Compiler_1_MODULA-2_SyntaxCheck/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/youseftareq33%2FJava_Compiler_1_MODULA-2_SyntaxCheck/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/youseftareq33%2FJava_Compiler_1_MODULA-2_SyntaxCheck/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/youseftareq33","download_url":"https://codeload.github.com/youseftareq33/Java_Compiler_1_MODULA-2_SyntaxCheck/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/youseftareq33%2FJava_Compiler_1_MODULA-2_SyntaxCheck/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":32420177,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-04-29T06:29:02.080Z","status":"ssl_error","status_checked_at":"2026-04-29T06:29:00.631Z","response_time":110,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.6:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["compiler","java","javafx","ll1-parser","modula2"],"created_at":"2024-11-06T06:22:02.503Z","updated_at":"2026-04-29T09:33:52.872Z","avatar_url":"https://github.com/youseftareq33.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# MODULA-2 Programming Language Syntax Check\n\n## Description:\nThis project involves developing an LL(1) predictive parser for a subset of the MODULA-2 programming language.\nThe goal is to implement a parser in Java that can read, tokenize, and parse source code written in this subset of MODULA-2, ensuring that the code adheres to the given grammar rules.\nThe parser will use an LL(1) parsing table to guide the parsing process.\n\n## Grammer Rules:\nmodule-decl --\u003e module-heading declarations block name . \n\nmodule-heading --\u003e **module** name ; \n\nblock --\u003e **begin** stmt-list **end**\n\ndeclarations --\u003e const-decl var-decl procedure-decl  \n\nconst-decl --\u003e **const** const-list | lambda\n\nconst-list --\u003e name = value ; const-list | lambda \n\nvar-decl --\u003e **var** var-list | lambda\n\nvar-list --\u003e var-item ; var-list | lambda\n\nvar-item --\u003e name-list : data-type\n\nname-list --\u003e name more-names \n\nmore-names --\u003e , name-list | lambda\n\ndata-type --\u003e **integer** | **real** | **char** \n\nprocedure-decl --\u003e procedure-heading declarations block name ; procedure-decl | lambda\n\nprocedure-heading --\u003e **procedure** name ; \n\nstmt-list --\u003e statement ; stmt-list | lambda\n\nstatement --\u003e ass-stmt | read-stmt | write-stmt | if-stmt | while-stmt | loop-stmt | exit-stmt | call-stmt | block | lambda\n\nass-stmt --\u003e name := exp\n\nexp --\u003e term exp-prime\n\nexp-prime --\u003e add-oper term exp-prime | lambda\t\n\nterm --\u003e factor term-prime  \n\nterm-prime --\u003e mul-oper factor term-prime | lambda\n\nfactor --\u003e  ( exp ) | name-value\n\nadd-oper --\u003e + | -  \n\nmul-oper --\u003e * | / | **mod** | **div**\n\nread-stmt --\u003e **readint** ( name-list ) | **readreal** ( name-list ) | **readchar** ( name-list ) | **readln**  \n\nwrite-stmt --\u003e **writeint** ( write-list ) | **writereal** ( write-list ) | **writechar** ( write-list ) | **writeln**  \n\nwrite-list --\u003e write-item more-write-value \n\nmore-write-value --\u003e , write-list | lambda\n\nwrite-item --\u003e name | value   \n\nif-stmt --\u003e **if** condition **then** stmt-list else-part **end**\n\nelse-part --\u003e **else** stmt-list | lambda\n\nwhile-stmt --\u003e **while** condition **do** stmt-list **end**\n\nloop-stmt --\u003e **loop** stmt-list **until** condition   \n\nexit-stmt --\u003e **exit**      \n\ncall-stmt --\u003e **call** name\n\ncondition --\u003e name-value relational-oper name-value   \n\nrelational-oper --\u003e = | |= | \u003c | \u003c= | \u003e | \u003e=\n\nname-value --\u003e name | value \n\nvalue --\u003e integer-value | real-value\n\n### Note:\n- name is generated by the regular expression:   letter ( letter | digit )*  \n\n- integer-value  is generated by the regular expression: \t digit ( digit )*   \n\n- real-value  is generated by the regular expression: \t digit ( digit )*.digit ( digit )*\n\n- The tokens in **bold** are reserved words or standard identifiers (library functions or procedures).\n\n- There is app_photo folder\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fyouseftareq33%2Fjava_compiler_1_modula-2_syntaxcheck","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fyouseftareq33%2Fjava_compiler_1_modula-2_syntaxcheck","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fyouseftareq33%2Fjava_compiler_1_modula-2_syntaxcheck/lists"}