43 Members
UIUC Linux Users Group - gnulug.org13 Servers

Load older messages

Timestamp Message
13 Jan 2020
17:28:25@chin123:matrix.orgchin123Or, I highly doubt
20:21:47@_slack_acm-uiuc_U743X2G2W:matrix.orgEric Huber I thought Mozilla's bisection tool downloaded appropriate nightly binaries rather than recompiling, but now I'm confused about what setup you have exactly that's exhibiting the issue

dont forget to apply to hackillinois

14 Jan 2020
00:26:40@_slack_acm-uiuc_U703EK36C:matrix.orgjavbit link
00:27:13@_slack_acm-uiuc_U703EK36C:matrix.orgjavbit http://go.hackillinois.org/challenge
02:52:10@harsh183:matrix.orgharsh183When is it
10:28:07@chin123:matrix.orgchin123Look at the website
16 Jan 2020
04:53:14@iyaja:matrix.orgiyaja Does anyone know a library that can parse go source code and save the AST in polish notation? I saw the go ast module, but I don't know go and I'm to lazy to write it.
15:27:17@_slack_acm-uiuc_U703EK36C:matrix.orgjavbit what do you mean polish notation
15:27:21@_slack_acm-uiuc_U703EK36C:matrix.orgjavbit it’ll be stored as a tree mostlikely
15:56:48@chin123:matrix.orgchin123 Yeah and you can convert to polish notation but it'll be a pain
16:52:55@_slack_acm-uiuc_U703EK36C:matrix.orgjavbit i guess they’re isomorphic
16:52:59@_slack_acm-uiuc_U703EK36C:matrix.orgjavbit like lisp
19:23:25@_slack_acm-uiuc_U743X2G2W:matrix.orgEric Huber It should be pretty easy to convert to polish notation
19:24:09@_slack_acm-uiuc_U743X2G2W:matrix.orgEric Huber In-order traversal, right?
19:25:08@adchari:matrix.orgadchariI thought Polish notation was like “+ 3 5”, wouldn’t inorder give you “3+5”
22:26:14@_slack_acm-uiuc_U743X2G2W:matrix.orgEric Huber You're right, I misspoke
22:26:51@_slack_acm-uiuc_U743X2G2W:matrix.orgEric Huber If you have an AST it's pretty easy to do this, not sure what's in mind though
17 Jan 2020
05:31:41@chin123:matrix.orgchin123 Well the problems I was thinking of is that this is not any n-ary tree
You'll need multiple switch cases and stuff to handle the different amount of children each node has while parsing or converting to polish notation which would be a pain
06:18:19@iyaja:matrix.orgiyaja Ok, strictly speaking, I don't need it in any particular notation/form. Even JSON is fine, then I can parse it in Python.
07:08:21@chin123:matrix.orgchin123 https://golang.org/pkg/go/parser/
07:08:49@chin123:matrix.orgchin123This looks promising
07:15:06@chin123:matrix.orgchin123 https://zupzup.org/go-ast-traversal/
In reply to @chin123:matrix.org
Yeah, that's the one I found yesterday. I'll probably modify and use that code. Can't find anything better.
16:31:57@_slack_acm-uiuc_U743X2G2W:matrix.orgEric Huber You can have a tree where each internal node has a variable number of children. You would need to tag the arity of the operator and other things but that's typical for an AST. If you haven't taken 421 yet, you actually will do this
16:32:11@_slack_acm-uiuc_U743X2G2W:matrix.orgEric Huber It's actually not too bad to implement
18:10:17@chin123:matrix.orgchin123 Yeah it was pretty annoying in 421, dealing with all the cases
I guess match statements instead of switch case made it better but it certainly wasn't pleasant

There are no newer messages yet.

Back to Room List