Alternatives to Syntax Trees

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]

Return to the comp.compilers page.
Search the comp.compilers archives again.