Re: A simpler way to tokenize and parse?

Christopher F Clark <christopher.f.clark@compiler-resources.com> schrieb:
> If I recall correctly, at one time, PCCTS and it’s related tool
> Sorcerer used an S-expression-like representation for ASTs, including an
> equivelnt to CAR and CDR, whose names I don’t recall but they were
> something like “down” and “right”.


S-expressions are a fairly natural representation of using trees,
at least for expressions.


An example: If you use gfortran's -fdump-fortran-original option, you
will get its internal expression after parsing on standard output.


For example, the code of


real function foo(x,y)
    foo = 2.3 + 5.0*x*y
end function foo


is represented as


    ASSIGN foo:foo (+ 2.29999995 (* (* 5.00000000 foo:x) foo:y))


where the internal representation is a tree.

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