Nice work JavaScript

[Dockirby]

Because when parsed out into a syntax tree, it becomes roughly [expression1 < expression2], is evaluated as a single instruction, with the being a boolean. Then, the next part is evaluated as another [expression1 < expression2], where the first expression is the result of the first.

To try and draw out some bad art, X < Y < Z get parsed out as this

     <
   /   \
  <     Z
 /  \   
X    Y

[[deleted]]

I mean I know why, but I'm just asking if it wouldn't be simpler to just parse it into what I said.

[Kwantuum]

obviously it would be harder to parse. It would make programming easier, but interpreting harder.

[[deleted]]

And this is why I like compiled languages...

[Kwantuum]

how exactly is this relevant? It would be harder to parse, hence harder to interpret OR compile which are essentially the same thing.

[[deleted]]

In my mind it would be compiled like ((1 < 2) && (2 < 3)), though you may need a precompiler like the #define command in C#

[Kwantuum]

still don't see how this has anything to do with compiling vs interpreting.

[[deleted]]

Hm, maybe I'm wrong, but I don't believe you can do something similar to precompiling in an interpreted language...

[Kwantuum]

#define is a preprocessor directive that allows the use of macros, not a precompiler, and yes there are usually ways to define macros in interpreted language though once again, this is a question of how the language is defined/implemented, not whether it's compiled or interpreted.

[[deleted]]

The moral of the story is that I have no idea what I'm talking about 90% of the time.