User loginNavigation |
archivesWaste your CPU-resources on programming challengeAl Zimmermann's Programming Contests has come up with a new problem that you can try to solve: Pack n non-overlapping circles with radii from 1 to N into as small a circle as possible. Try to find the best solution by mid January. By mattias waldau at 2005-10-31 08:18 | LtU Forum | login or register to post comments | other blogs | 7245 reads
Parsing and syntax reordering
I been doing some programming language design and I ran into something that I am sure as a name, and I thought I would ask too see if anybody could tell me what it is.
I found that the two syntaxes have the same effect (at least the way that I think of languages):
def x <-> x ie. the first defines a variable x in the symbol table, the second defines a function x with an arguement y and a body z, etc. Now the question is: what is the name of a parsing and reordering scheme for transforming the form on the right to the form on the left? I'm not sure if I am using the correct terminology, but basically I'm looking for the algorithm that could be used to convert tokens (or a parse tree maybe?) from the form on the right to the form on the left. Any help appreciated.
-- |
Browse archivesActive forum topics |
Recent comments
36 weeks 23 hours ago
36 weeks 1 day ago
36 weeks 1 day ago
1 year 6 weeks ago
1 year 10 weeks ago
1 year 12 weeks ago
1 year 12 weeks ago
1 year 14 weeks ago
1 year 19 weeks ago
1 year 19 weeks ago