{"id":22971587,"url":"https://github.com/rmrt1n/parsers","last_synced_at":"2026-01-11T03:04:09.612Z","repository":{"id":50222968,"uuid":"372830591","full_name":"rmrt1n/parsers","owner":"rmrt1n","description":"an exploration of parsing techniques","archived":false,"fork":false,"pushed_at":"2023-04-26T08:19:31.000Z","size":16,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-04-02T06:21:44.593Z","etag":null,"topics":["parsers","parsing","pratt-parsing","recursive-ascent-parser","recursive-descent-parser","scheme"],"latest_commit_sha":null,"homepage":"","language":"Scheme","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/rmrt1n.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","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}},"created_at":"2021-06-01T12:57:50.000Z","updated_at":"2023-04-26T08:19:35.000Z","dependencies_parsed_at":"2025-04-02T06:21:28.466Z","dependency_job_id":"23bc997c-388f-4f0f-a7ad-79940cab0840","html_url":"https://github.com/rmrt1n/parsers","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/rmrt1n/parsers","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rmrt1n%2Fparsers","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rmrt1n%2Fparsers/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rmrt1n%2Fparsers/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rmrt1n%2Fparsers/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/rmrt1n","download_url":"https://codeload.github.com/rmrt1n/parsers/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rmrt1n%2Fparsers/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":28274286,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-01-11T02:08:32.518Z","status":"ssl_error","status_checked_at":"2026-01-11T02:08:32.093Z","response_time":60,"last_error":"SSL_read: 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":["parsers","parsing","pratt-parsing","recursive-ascent-parser","recursive-descent-parser","scheme"],"created_at":"2024-12-14T22:19:35.793Z","updated_at":"2026-01-11T03:04:09.595Z","avatar_url":"https://github.com/rmrt1n.png","language":"Scheme","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Parsers\nAn exploration of parsing techniques in r7rs scheme.  \nThe parsing target are math expressions following this grammar:  \n\n```\nexpr -\u003e expr ('+' | '-') term | term\nterm -\u003e term ('*' | '/' | '%') factor | factor\nfactor -\u003e power '^' factor | power\npower -\u003e ('-' | '+') power | base\nbase -\u003e '(' expr ')' | number\nnumber -\u003e [0-9]+\n```\n\n## Techniques\nFor now these are the parsing techniques I used:  \n- [recursive descent](https://en.wikipedia.org/wiki/Recursive_descent_parser) -\u003e `rec-desc.sld`\n- [recursive ascent](https://en.wikipedia.org/wiki/Recursive_ascent_parser) -\u003e `rec-asc.sld`\n- [pratt](https://en.wikipedia.org/wiki/Operator-precedence_parser#Pratt_parsing) -\u003e `pratt.sld`\n\n## Resources\nThese are the resources I used for learning about parsers:  \n**recursive descent parsing**:  \n- [Parsing Expressions . Crafting Interpreters](https://craftinginterpreters.com/parsing-expressions.html) \n- [Let's Build a Simple Interpreter](https://ruslanspivak.com/lsbasi-part7/)\n- [Create a programming language [part 3] - The Parser](https://www.youtube.com/watch?v=4HW3RAoWMpg)\n- [Recursive Descent Parser in OCaml](https://www.youtube.com/watch?v=5RVyIP5p5aM)\n\n**recursive ascent parsing**:\n- [Writing a recursive ascent parser by hand](https://www.abubalay.com/blog/2018/04/08/recursive-ascent)\n- [lalr1-table-generator](https://github.com/alexpizarroj/lalr1-table-generator)\n- [Recursive Ascent: An LR Analog to Recursive Descent](https://dl.acm.org/doi/pdf/10.1145/47907.47909)\n- [Recursive-Ascent Parsing](https://dl.acm.org/doi/pdf/10.5555/770818.770849)\n\n**pratt parsing**:\n- [Simple but Powerful Pratt Parsing](https://matklad.github.io/2020/04/13/simple-but-powerful-pratt-parsing.html)\n- [Pratt Parsing](https://dev.to/jrop/pratt-parsing)\n- [prattparser](https://github.com/richardjennings/prattparser)\n\n## License\nDistributed under the MIT License. See [LICENSE](/LICENSE) for more information.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frmrt1n%2Fparsers","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Frmrt1n%2Fparsers","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frmrt1n%2Fparsers/lists"}