Hi Mike and Steve,
I just wanted to check out daffodil and hack a bit around to get used to it.
Could you point me on an easy end-to-end test which I can use to enter and
trace a bit around?
Thanks!
Julian
Hi guys,
I just had a discussion yesterday with Mike and Steve and we already had
several discussions before in the PLC4X project.
We like Daffodil but have the issue that we do not fit with the “Interpreter”
Runtime it currently is.
Mainly for two issues, performance and interoperability.
So Id
Hi Julian,
Within the DFDL tree, probably the simplest test that runs end-to-end, search
for this line:
@Test def test_unsignedInt() { runner.runOneTest("TestUnsignedInt") }
This will compile a schema, then use it to parse a trivial unsigned text
integer, but you can walk through the code an
Hi Mike,
thanks, I found the CSV one which was sufficient form e to find the right
jumpin points (gee... scala is nice but also a pain in the ass, I forgot) : >
Julian
Am 11.09.19, 10:34 schrieb "Beckerle, Mike" :
Hi Julian,
Within the DFDL tree, probably the simplest test that r
Conceptually about right.
Daffodil has 3 trees in the compiler
First is the DSOM tree. This is the AST. Its structure matches that of the
schema document (s).
Second is the "Gram" or grammar tree. (So called because we tried to make them
work sort of like Scala's combinator parser "rules" for
Would love to hang around with you in the hackathon to hack a bit about that...
From: Beckerle, Mike
Sent: Wednesday, September 11, 2019 10:51:39 AM
To: dev@daffodil.apache.org
Subject: Re: [GENERATION] Code generation with Daffodil
Conceptually about right.
Daf
Michael Beckerle created DAFFODIL-2201:
--
Summary: Test Daffodil using GraalVM
Key: DAFFODIL-2201
URL: https://issues.apache.org/jira/browse/DAFFODIL-2201
Project: Daffodil
Issue Type: Im
