Alternatives to Syntax Trees

Path	csiph.com!weretis.net!feeder6.news.weretis.net!feeder.usenetexpress.com!feeder1.iad1.usenetexpress.com!216.166.98.84.MISMATCH!border1.nntp.dca1.giganews.com!border2.nntp.dca1.giganews.com!nntp.giganews.com!news.iecc.com!.POSTED.news.iecc.com!nerds-end
From	Seima Rao <seimarao@gmail.com>
Newsgroups	comp.compilers
Subject	Alternatives to Syntax Trees
Date	Tue, 17 Jan 2017 14:16:27 +0530
Organization	Compilers Central
Lines	34
Sender	news@iecc.com
Approved	comp.compilers@iecc.com
Message-ID	<17-01-006@comp.compilers> (permalink)
References	<17-01-002@comp.compilers> <17-01-005@comp.compilers>
Mime-Version	1.0
Content-Type	text/plain; charset=UTF-8
Injection-Info	miucha.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="34136"; mail-complaints-to="abuse@iecc.com"
Keywords	analysis, question
Posted-Date	17 Jan 2017 09:12:29 EST
X-submission-address	compilers@iecc.com
X-moderator-address	compilers-request@iecc.com
X-FAQ-and-archives	http://compilers.iecc.com
Xref	csiph.com comp.compilers:1812

Show key headers only | View raw

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:

Specific

    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)

General

    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?

--
Sincerely,
Seima Rao.
[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]

Thread

Alternatives to Syntax Trees Seima Rao <seimarao@gmail.com> - 2017-01-15 16:52 -0500
  Re: Alternatives to Syntax Trees Kaz Kylheku <221-501-9011@kylheku.com> - 2017-01-15 22:31 +0000
  Re: Alternatives to Syntax Trees George Neuner <gneuner2@comcast.net> - 2017-01-16 06:11 -0500
  Re: Alternatives to Syntax Trees rpw3@rpw3.org (Rob Warnock) - 2017-01-16 12:12 +0000
    Alternatives to Syntax Trees Seima Rao <seimarao@gmail.com> - 2017-01-17 14:16 +0530
      Re: Alternatives to Syntax Trees Kaz Kylheku <221-501-9011@kylheku.com> - 2017-01-17 22:39 +0000
      Re: Alternatives to Syntax Trees George Neuner <gneuner2@comcast.net> - 2017-01-17 22:08 -0500

csiph-web