{"id":21447214,"url":"https://github.com/githubprankster/forward","last_synced_at":"2025-08-04T10:32:33.879Z","repository":{"id":157731295,"uuid":"267920350","full_name":"GithubPrankster/forward","owner":"GithubPrankster","description":"The (Extremely) Minimal Forth Interpreter in C.","archived":false,"fork":false,"pushed_at":"2020-05-29T23:56:48.000Z","size":6,"stargazers_count":9,"open_issues_count":0,"forks_count":1,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-07-14T22:43:33.725Z","etag":null,"topics":["c","challenge","forth","interpreter","minimal"],"latest_commit_sha":null,"homepage":null,"language":"C","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/GithubPrankster.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,"zenodo":null}},"created_at":"2020-05-29T17:48:07.000Z","updated_at":"2024-06-26T02:14:46.000Z","dependencies_parsed_at":null,"dependency_job_id":"17293b46-5f99-4204-be17-0680ec89e773","html_url":"https://github.com/GithubPrankster/forward","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/GithubPrankster/forward","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/GithubPrankster%2Fforward","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/GithubPrankster%2Fforward/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/GithubPrankster%2Fforward/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/GithubPrankster%2Fforward/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/GithubPrankster","download_url":"https://codeload.github.com/GithubPrankster/forward/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/GithubPrankster%2Fforward/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":268682595,"owners_count":24289666,"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","status":"online","status_checked_at":"2025-08-04T02:00:09.867Z","response_time":79,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"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":["c","challenge","forth","interpreter","minimal"],"created_at":"2024-11-23T03:09:21.393Z","updated_at":"2025-08-04T10:32:33.871Z","avatar_url":"https://github.com/GithubPrankster.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"## Forth Oriented Rational Wacky Arithmetic Reason Determinator\nAn interpreter of the bare essentials of Forth in 150~ lines.\nSupported are the usual arithmetic operations, a few stack/print ones and the heart of Forth, names. Support for arrays and branching has yet to be figured out.\n\n### Compiling \u0026 Time\n`gcc -Ofast -march=native -mtune=native -s -static -static-libgcc forward.c -o forward`\n\nCompilation on a AMD FX-8350 yielded a time of:\n```\nreal    0m0.163s\nuser    0m0.118s\nsys     0m0.045s\n```\n\n### Example\n```forth\n: STAR 42 EMIT ;\n: LINE STAR STAR STAR STAR STAR ;\nLINE CR STAR CR LINE CR STAR CR STAR CR\n```\nThis shall give you a nice F.\n\n### Implementation of Names\nI made a structure which contains the name itself and what follows after until `;`. Then whenever the evaluator finds a letter, it checks against the currently stored names, and if a match is found, *it evaluates the name's buffer*. The fact this process is recursive highlights one of the powers of Forth. Currently however, replacement of pre-defined names is not implemented. Be careful making names that are already pre-defined in the interpreter. Or not, that's your call.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgithubprankster%2Fforward","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fgithubprankster%2Fforward","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgithubprankster%2Fforward/lists"}