|
|
|
| Authored by: bugstomper on Tuesday, May 15 2012 @ 11:30 AM EDT |
No, I don't think I fell for anything. That's why I ended up in the source code
to see what really is done. The table that the 01 refers to is the Field Table
that contains a reference to a class and a reference to a string that is the
name of a field of that class. As you said, if it were a symbol there would be a
resolution step. Well, guess what, that code I quoted is the resolution step.
That code looks up the symbol in the list of fields for that class and finds the
field that contains the same name, using a linear search and string compares,
returning a pointer to the field. A classic resolution step.
Terrence Parr testified about the '520 patent (static array initialization). It
was David August who testified on the symbolic reference resolution patent and I
quoted him in my comment. He is so careful to say that it is not "symbol
resolution" for the patent by the court's construction because it is not
dynamic. He uses that to step around the fact that a symbolic reference (in
computer science terminology) is being resolved.[ Reply to This | Parent | # ]
|
|
|
|
|
