How can one use Lark to generate an Abstract Binding Tree (ABT)?

[brando90]

I was reading Robert Harper's book (http://www.cs.cmu.edu/~rwh/pfpl/index.html) and was wondering if it was possible to generate Abstract Binding Trees (ABTs) instead of ASTs with Lark. How would one do this?

On a very vague way I thought one could generate the AST then replace variable names with De Brujin indices and somehow use that information to point back to the right binder. Would that work?

I'm a none PL expert so I am wondering how one would generate ABTs.