On 18 May 2014 13:54, Byron Jeff <byronjeff@mail.clayton.edu> wrote:

> A =3D 3
>
> would require scanning through all possible keywords, reaching the end of
> the list, then deciding it must be a variable and then it's an assignment
> statement. Whereas:
>
> LET A =3D 3
>
> is keyworded with a specific keyword which is easy to find and defines th=
e
> semantics of the statement.
>
> Parsing the latter is much easier.
>

Would that make any difference knowing that Basic implementations on old
(70s - 80s) computers were tokenizing Basic language before storing it in
memory or on tape/disk? Usually that happens when entering the source code
from the keyboard, therefore a slow lookup method should not be a big issue
-- and after tokenization this should not be matter as tokens are already
telling the interpreter what that is, right?

Tamas



>
> BAJ
>
> >
> > BillW
> >
> >
> > --
> > http://www.piclist.com/techref/piclist PIC/SX FAQ & list archive
> > View/change your membership options at
> > http://mailman.mit.edu/mailman/listinfo/piclist
>
> --
> Byron A. Jeff
> Chair: Department of Computer Science and Information Technology
> College of Information and Mathematical Sciences
> Clayton State University
> http://faculty.clayton.edu/bjeff
> --
> http://www.piclist.com/techref/piclist PIC/SX FAQ & list archive
> View/change your membership options at
> http://mailman.mit.edu/mailman/listinfo/piclist
>



--=20
int main() { char *a,*s,*q; printf(s=3D"int main() { char *a,*s,*q;
printf(s=3D%s%s%s, q=3D%s%s%s%s,s,q,q,a=3D%s%s%s%s,q,q,q,a,a,q); }",
q=3D"\"",s,q,q,a=3D"\\",q,q,q,a,a,q); }
--=20
http://www.piclist.com/techref/piclist PIC/SX FAQ & list archive
View/change your membership options at
http://mailman.mit.edu/mailman/listinfo/piclist
.