ke Beckerle
> Sent: Wednesday, January 24, 2024 1:55 PM
> To: dev@daffodil.apache.org
> Subject: EXT: Theoretical Interest item - Pull Request with example schema
> that illustrates pathological (super-exponential) DFDL behaviors
>
> I have been concerned for a while that combination
enting. A schema compile time check would
> be even better if a way is found to formally prove the theoretical O(sn)
> constraint.
>
> -Original Message-
> From: Mike Beckerle
> Sent: Wednesday, January 24, 2024 1:55 PM
> To: dev@daffodil.apache.org
> Subject: EXT:
rg
Subject: EXT: Theoretical Interest item - Pull Request with example schema that
illustrates pathological (super-exponential) DFDL behaviors
I have been concerned for a while that combinations of the features in DFDL
v1.0 can be used in ways that are just far too powerful for what is needed for
data fo
I have been concerned for a while that combinations of the features in DFDL
v1.0 can be used in ways that are just far too powerful for what is needed
for data format expression.
For example, if the input data to parse is n bits, how large should the
corresponding infoset be when the data is parse
