Comments by "B. Xoit" (@b43xoit) on "LaurieWired" channel.

  1. To show an example of coding something in assembly language, so people have a clue as to how computers can work?
    3
  2. It should be equally easy. Just recurse without a base case.
    2
  3. Typical implementations of FORTH have the call stack and the operand stack growing toward each other from the two ends of one area of memory.
    1
  4. That's right -- the absence of noise-vocalizations makes the speech easier to hear and understand and shows respect for the audience and self-respect.
    1
  5. `dc` also works well.
    1
  6. Particularly constants.
    1
  7. Yes, the compiler figures out that the recursive call is immediately followed by a return. This is a tail call. It is optimized by making it not push the stack (and not pop the stack).
    1
  8. The algo she showed has no C++ features in it, so she might as well have just said it is in C.
    1
  9. How did you do multiple inheritance in C++? Does the language natively support it?
    1
  10. Interesting; I hadn't caught on that the OO in C++ was that powerful.
    1
  11. [snicker]
    1
  12. You're welcome.
    1
  13.  @notiashvili  Yes.
    1
  14. You run out of stack.
    1