|Alternatives to Syntax Trees firstname.lastname@example.org (Seima Rao) (2017-01-15)|
|Re: Alternatives to Syntax Trees email@example.com (Kaz Kylheku) (2017-01-15)|
|Re: Alternatives to Syntax Trees firstname.lastname@example.org (George Neuner) (2017-01-16)|
|Re: Alternatives to Syntax Trees email@example.com (2017-01-16)|
|Alternatives to Syntax Trees firstname.lastname@example.org (Seima Rao) (2017-01-17)|
|Re: Alternatives to Syntax Trees email@example.com (Kaz Kylheku) (2017-01-17)|
|Re: Alternatives to Syntax Trees firstname.lastname@example.org (George Neuner) (2017-01-17)|
|From:||Seima Rao <email@example.com>|
|Date:||Tue, 17 Jan 2017 14:16:27 +0530|
|Injection-Info:||miucha.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="34136"; mail-complaints-to="firstname.lastname@example.org"|
|Posted-Date:||17 Jan 2017 09:12:29 EST|
Thanks for your responses!
Your responses together with acm.org/dl(of which I
am currently not a member of) helped me mark
down the todos.
For those of you interested, I have some questions:
Q: What happens when we balance a syntax tree ?
Q: What happens when we use a B-tree (say) ?
You may or may not seek recourse to language-only domains.
(some might want to discuss structural analysis aka Muchnick)
(some might want to discuss dbms)
Q: Yacc(and likewise tools) make use of a set of rules in helping
,make progress in computing.
Are there approaches other then AI that use rule based computing?
[To the first question, I suppose it might be useful if you're trying to reorganize
an expression to fit into a limited set of registers so each subtree is about the same
size, but it seems pretty marginal. To the second, that's not a
meaningful question. B-Trees are a way of organizing indexed data on disks, not
relevant to data structures a compiler might use in memory. -John]
Return to the
Search the comp.compilers archives again.