diff options
author | Björn Gustavsson <[email protected]> | 2014-12-05 07:48:26 +0100 |
---|---|---|
committer | Björn Gustavsson <[email protected]> | 2015-01-12 12:22:57 +0100 |
commit | e96b4bbb802cd00fa14deb12d7200873c7a79e85 (patch) | |
tree | d65e90c80a01fc6288eaae59e08ed143c2d65bbc /lib/asn1/test/asn1_SUITE_data/TCAPPackage.asn1config | |
parent | 7129f2acb474651fa4ef922b24ff18dd84dd9c77 (diff) | |
download | otp-e96b4bbb802cd00fa14deb12d7200873c7a79e85.tar.gz otp-e96b4bbb802cd00fa14deb12d7200873c7a79e85.tar.bz2 otp-e96b4bbb802cd00fa14deb12d7200873c7a79e85.zip |
asn1ct_parser2: Remove expensive lookahead_assignment/1 function
In the parsing of a value assignment, such as:
value INTEGER ::= 42
there is call to a function called lookahead_assignment/1 that
will ensure that the sequence of tokens that follows the value
is a valid assignment. The problem is that if the next assignment
is a value assignment, that too will look ahead to the next
assignment. That means that the complexity will be quadratic
if there are many value assignments following each other.
The reason for the test in the first place is unclear; my guess
is that it was an attempt to provide better error reporting.
Diffstat (limited to 'lib/asn1/test/asn1_SUITE_data/TCAPPackage.asn1config')
0 files changed, 0 insertions, 0 deletions