{"id":16087032,"url":"https://github.com/noha/prolog","last_synced_at":"2026-01-24T15:35:42.256Z","repository":{"id":141786418,"uuid":"273690075","full_name":"noha/Prolog","owner":"noha","description":"An attempt to implement a prolog interpreter in pharo","archived":false,"fork":false,"pushed_at":"2020-06-25T13:46:30.000Z","size":82,"stargazers_count":5,"open_issues_count":0,"forks_count":0,"subscribers_count":3,"default_branch":"master","last_synced_at":"2025-04-05T14:44:44.785Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Smalltalk","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/noha.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":"2020-06-20T10:53:30.000Z","updated_at":"2023-03-23T12:35:07.000Z","dependencies_parsed_at":"2023-03-17T05:15:45.270Z","dependency_job_id":null,"html_url":"https://github.com/noha/Prolog","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/noha/Prolog","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/noha%2FProlog","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/noha%2FProlog/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/noha%2FProlog/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/noha%2FProlog/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/noha","download_url":"https://codeload.github.com/noha/Prolog/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/noha%2FProlog/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":28730322,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-01-24T10:24:43.181Z","status":"ssl_error","status_checked_at":"2026-01-24T10:24:36.112Z","response_time":89,"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":[],"created_at":"2024-10-09T13:27:06.423Z","updated_at":"2026-01-24T15:35:42.242Z","avatar_url":"https://github.com/noha.png","language":"Smalltalk","funding_links":[],"categories":[],"sub_categories":[],"readme":"Prolog\n------\n\nAnother attempt to start a project that has low odds of being finished ever. This is my trial of understanding and implementing a prolog interpreter. I try to keep my struggles not only in code but also in this readme. \n\n- [x] started test hierarchy to test parser model\n- [x] added more tests for the grammar\n- [ ] add tests for unification\n- [ ] implement operator model\n- [ ] add tests for complex compound terms\n- [ ] add test for member/2\n- [ ] add test for append/3\n- [ ] collect examples to parse for making basic grammar more solid\n- [ ] understand lists. How to implement comman lists and hole lists best???\n\n__2020-06-24__\n\nSolve left recursion problem with prefix and infix compound terms. Unification attempts\n\n- [x] understand compound terms (Xfix notation)\n- [x] infix, postfix, etc. operators in prolog are special entities with configuration of Xfix notation and precedence\n- [x] so my conclusion is to start with petit parser that can parse a family tree knowledgebase\n- [x] first working unification between simple compound terms. Straight unification by double dispatch through the structure\n- [x] terms now have a parent pointer to be able to identify the top term\n- [x] unification on call is difficult. Call contexts are bound to the term issued caller-\u003ecallee. Unification uses respective terms to resolve variables in their own call context\n- [ ] add more tests for grammar\n- [ ] add tests for unification\n\n__2020-06-22__\n\nClear up terminology to be able to name the parser rule accordingly\n\n- [x] understand basic terminolgy\n- [x] term is the driving term ;) for the syntax\n- [x] a term can be an atom, a variable, a number or a compound term\n- [x] compound terms are either prefix where the leading atom is called functor or\n- [x] repository needs baseline to be loaded (including petit parser)\n- [ ] understand compound terms (Xfix notation)\n\n__2020-06-20__\n\nStarting all over. After the prolog class I need to clarify terminology. Prolog tends to have a lot of terms to describe things on different axes. Insights collected so far (if checked I think the code can do this already):\n\n- [ ] understand basic terminolgy\n\nLinks:\n- [ISO Standard](https://www.iso.org/standard/21413.html)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnoha%2Fprolog","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fnoha%2Fprolog","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnoha%2Fprolog/lists"}