> Consider you're in scope A. You see some block-scoped variables. Then > you see a nested scope B. You go in to visit it, and once you're done > visiting it you can know how many block-scoped variables there were in > B. However after visiting it there can be more variables in A. That's > why a simple high-water-mark algorithm is inappropriate.
One potential design for this: - Parser tracks a stack of "block scopes" - When the parser encounters a "let" statement: assert that "block scopes" is not empty or else parse error add 1 to the top entry in "block scopes" Would this satisfy your needs? Geoff _______________________________________________ squirrelfish-dev mailing list [email protected] http://lists.webkit.org/mailman/listinfo.cgi/squirrelfish-dev
