stdVBA VS peg-bootstrap

I do RPA from VBA personally using IAccessiblity. See stdAcc (https://github.com/sancarn/stdVBA/blob/master/src/stdAcc.cls) and an example (https://github.com/sancarn/stdVBA-examples/tree/main/Example...)

You could have just treated everything as variant correct? That's what we do here: https://github.com/sancarn/stdVBA/blob/master/src/stdLambda....

The responses I got was a mix. Some businesses didn't take me seriously because the main language I used was VBA. Some businesses claimed I was too eager and I "didn't have a life". No one seemed to care about the achievements I had made in the languages, like building a DSL in VBA, or this electron app. I did eventually get a job in another engineering firm though, where I spend 90% of my time to this day programming.

Really depends what you actually want to do and how neat (or fast) you want your code to be too... I typically use stdEnumerator and stdLambda from stdVBA.

Sometimes, though more of a library / tool developer here. See stdVBA or stdVBA-examples

That said it is effort. After building stdLambda which brings lambda syntax to VBA, I can tell you that error handling in this class is still trash. It's just a lot of effort to write good error messages, and handle all errors correctly. Still definitely an item on the TODO list, but will it ever be a priority? idk

Otherwise this library poses as an example of how to use stdVBA libraries. Libraries used in this project: stdEnumerator, stdArray, stdCallback, stdCOM, stdICallable, stdLambda, stdRegex.

If you want a solution though see stdSettings. There are both system and user settings. Users are bound by their domain, so should work across organisations :)

Use stdVBA's stdAcc:

Explaining code in such a way that it codes the correct thing is pretty awful though... Let's try to do that for stdTimer.

a problem that a lot of these series run into is that the author runs out of steam before they finish writing them. crenshaw's otherwise excellent series suffers from this, for example

so far the author of this one has only written the first chapter

i've written a few didactic compilers that are complete enough to compile themselves, though nothing else

https://github.com/kragen/stoneknifeforth (from a forth-like language to an i386 linux elf executable)

https://github.com/kragen/peg-bootstrap/blob/master/peg.md (from a peg language description with semantic actions to javascript)

http://canonical.org/~kragen/sw/urscheme (from a subset of scheme to at&t-syntax i386 assembly)

That's powerful enough to conveniently write, for example, a numerical root finding program for an arbitrary arithmetic expression.

But I think that within a complexity budget of 150 lines of code you can maybe be even more ambitious than that.

The example compiler in https://github.com/darius/parson/blob/master/eg_calc_compile... is a bit more stripped down than that, but in its 32 lines of code it compiles arithmetic assignment statements to a three-address RISC-like code (though using an unbounded number of registers). https://github.com/darius/parson/blob/master/eg_calc_to_rpn.... is a 16-line version that compiles the same language to a stack machine like your tutorial example.

In 66 lines of code in https://github.com/kragen/peg-bootstrap/blob/master/peg.md I wrote an example compiler which compiles a PEG grammar into a JavaScript parser for that grammar. Admittedly those 66 lines do not include an implementation of JavaScript to run the code on. It compiles the language it's written in.

In 132 lines of code in https://github.com/kragen/stoneknifeforth/blob/master/tinybo... I wrote an example compiler which compiles a crippled Forth dialect into i386 machine code, including an ELF header so you can run the result. It also compiles the language it's written in. It also doesn't include an i386 emulator to run it on.

In 83 lines of code in http://canonical.org/~kragen/sw/dev3/neelcompiler.ml Neel Krishnaswami wrote a compiler from the untyped λ-calculus to a simple assembly language for a register machine. It also doesn't include an implementation of the assembly language.

In 18 lines of code in http://canonical.org/~kragen/sw/dev3/meta5ix.m5, a simplification of META-II, I wrote a compiler from grammar descriptions to an assembly code for a parsing-oriented virtual machine. It compiles the language it's written in. A Python interpreter for the machine is in http://canonical.org/~kragen/sw/dev3/meta5ixrun.py (109 lines of code) and a precompiled version of the compiler-compiler for bootstrapping is in http://canonical.org/~kragen/sw/dev3/meta5ix.generated.m5asm.

A slightly incompatible variant of Meta5ix which instead compiles itself to C is in http://canonical.org/~kragen/sw/dev3/meta5ix2c.m5 (133 lines of code, depending on how you count). (No C compiler is included.) The precompiled C output for bootstrapping is in http://canonical.org/~kragen/sw/dev3/meta5ix2c.c.

Meta5ix is extremely weak and limited, really only enough for a compiler front-end; it can't, for example, do the kinds of RPN tricks we're talking about above.

Oh goodness, I never thought about using LuaLaTeX for that! I wrote handaxeweb.lua originally for https://github.com/kragen/peg-bootstrap/peg.md but have used it for various things since then.

I did pretty much the same thing with https://github.com/kragen/peg-bootstrap/blob/master/peg.md, although admittedly hand-compiling to JS was noticeably less work than hand-compiling to assembly language would have taken. My friend Dave did something similar with Val Schorre's META-II: https://queue.acm.org/detail.cfm?id=2724586