{"action":"closed","issue":{"url":"https://api.github.com/repos/phil-hutchinson/arborate-java-compiler/issues/24","repository_url":"https://api.github.com/repos/phil-hutchinson/arborate-java-compiler","labels_url":"https://api.github.com/repos/phil-hutchinson/arborate-java-compiler/issues/24/labels{/name}","comments_url":"https://api.github.com/repos/phil-hutchinson/arborate-java-compiler/issues/24/comments","events_url":"https://api.github.com/repos/phil-hutchinson/arborate-java-compiler/issues/24/events","html_url":"https://github.com/phil-hutchinson/arborate-java-compiler/issues/24","id":389047986,"node_id":"MDU6SXNzdWUzODkwNDc5ODY=","number":24,"title":"Modify grammar to better use abstract syntax tree","user":{"login":"phil-hutchinson","id":21108547,"node_id":"MDQ6VXNlcjIxMTA4NTQ3","avatar_url":"https://avatars1.githubusercontent.com/u/21108547?v=4","gravatar_id":"","url":"https://api.github.com/users/phil-hutchinson","html_url":"https://github.com/phil-hutchinson","followers_url":"https://api.github.com/users/phil-hutchinson/followers","following_url":"https://api.github.com/users/phil-hutchinson/following{/other_user}","gists_url":"https://api.github.com/users/phil-hutchinson/gists{/gist_id}","starred_url":"https://api.github.com/users/phil-hutchinson/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/phil-hutchinson/subscriptions","organizations_url":"https://api.github.com/users/phil-hutchinson/orgs","repos_url":"https://api.github.com/users/phil-hutchinson/repos","events_url":"https://api.github.com/users/phil-hutchinson/events{/privacy}","received_events_url":"https://api.github.com/users/phil-hutchinson/received_events","type":"User","site_admin":false},"labels":[],"state":"closed","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":0,"created_at":"2018-12-09T18:07:06Z","updated_at":"2018-12-09T19:18:55Z","closed_at":"2018-12-09T19:18:55Z","author_association":"OWNER","body":"The tree being produced by the parse looks more like a CST than a AST:\r\n\r\ne.g. 2 * 5 ends up something like this:\r\n\r\nexpr\r\n== expr\r\n==== term\r\n====== factor\r\n======== int_lit\r\n== term\r\n==== factor\r\n====== int_lit\r\n\r\nwhen it should look more like\r\n\r\nmult_expr\r\n== int_lit\r\n== int_lit\r\n\r\nThis will become cumbersome as the many layers of precedence are added.\r\n\r\nGoal is to simplify by having a single \"expr\" AST node that handles all types of expresions, with no more depth to the tree than is required by the expression itself."}}
{"actor":{"display_login":"phil-hutchinson"}}