{"id":17134721,"url":"https://github.com/robojones/parser-test","last_synced_at":"2025-03-24T06:17:52.465Z","repository":{"id":133113391,"uuid":"220502269","full_name":"robojones/parser-test","owner":"robojones","description":"Recursive descend parser for a simple test language","archived":false,"fork":false,"pushed_at":"2019-11-08T18:05:35.000Z","size":13,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-03-22T22:01:45.610Z","etag":null,"topics":["parser","recursive-descent-parser"],"latest_commit_sha":null,"homepage":null,"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/robojones.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}},"created_at":"2019-11-08T16:05:57.000Z","updated_at":"2019-11-08T18:05:37.000Z","dependencies_parsed_at":"2023-04-22T02:15:38.630Z","dependency_job_id":null,"html_url":"https://github.com/robojones/parser-test","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/robojones%2Fparser-test","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/robojones%2Fparser-test/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/robojones%2Fparser-test/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/robojones%2Fparser-test/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/robojones","download_url":"https://codeload.github.com/robojones/parser-test/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":245217946,"owners_count":20579300,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","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":["parser","recursive-descent-parser"],"created_at":"2024-10-14T19:45:34.499Z","updated_at":"2025-03-24T06:17:52.409Z","avatar_url":"https://github.com/robojones.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Parser Test\nA recursive descend parser for a simple test syntax.\n\n### Tree\n\nThe tree contains a node for every grammar rule applied and every token consumed.\nThe tree node contains the name of the rule, or the token itself as label.\nIf `ϵ` is matched, then the node has the label \"epsilon\".\n\nThe tree produced by this parser is **not useful in any way**.\nThe purpose of this project was to learn, how a recursive descend parser works.\n\n### Syntax\n\n| Grammar |\n|---------|\n| start → stmt_list `$$`\n| stmt_list → stmt stmt_list \\| `ϵ`\n| stmt → `id` := expr \\| `read` `id` \\| `write` expr\n| expr → term term_tail\n| term_tail → add_op term term_tail \\| `ϵ`\n| term → factor factor_tail\n| factor_tail → mult_op factor factor_tail \\| `ϵ`\n| factor → `(` expr `)` \\| `id` \\| `literal`\n| add_op → `+` \\| `-`\n| mult_op → `*` \\| `/`\n| `literal` is defined as any sequence of digits (e.g. 15 or 543234).\n| `id` is defined as a token that does not match any other token.\n| `ϵ` means empty\n\n### First set\n| Token | First(token) |\n|-------|--------------|\n| start | id, read, write, $$\n| stmt_list | id, read, write, `ϵ`\n| stmt | id, read, write\n| expr | id, literal, (\n| term_tail | +, -, `ϵ`\n| term | id, literal, (\n| factor_tail | *, /, `ϵ`\n| factor | id, literal, (\n| add_op | +, -\n| mult_op | *, /\n\n### Follow set\n\n| Token | Follow(token) |\n|-------|---------------|\n| start | |\n| stmt_list | $$ |\n| stmt | id, read, write, $$\n| expr | id, read, write, $$, )\n| term_tail | id, read, write, $$, )\n| term | id, read, write, $$, ), =, +, -\n| factor_tail | id, read, write, $$, ), =, +, -\n| factor | *, /, id, write, $$, ), =, +, -\n| add_op | id, literal, (\n| mult_op | id, literal, (\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frobojones%2Fparser-test","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Frobojones%2Fparser-test","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frobojones%2Fparser-test/lists"}