US 11,941,380 B1
Automatic code reconfiguration based on function and subfunction analysis
Carmit Sahar, Tel Aviv (IL)
Assigned to Aurora Labs Ltd., Tel Aviv (IL)
Filed by Aurora Labs Ltd., Tel Aviv (IL)
Filed on May 16, 2023, as Appl. No. 18/318,354.
Application 18/318,354 is a continuation of application No. 18/048,690, filed on Oct. 21, 2022, granted, now 11,693,635.
This patent is subject to a terminal disclaimer.
Int. Cl. G06F 8/40 (2018.01); G06F 8/41 (2018.01)
CPC G06F 8/427 (2013.01) [G06F 8/436 (2013.01)] 16 Claims
OG exemplary drawing
 
1. A non-transitory computer-readable medium including instructions that, when executed by at least one processor, cause the at least one processor to perform operations for automatically reconfiguring code based on function and subfunction analysis, the operations comprising:
determining, by parsing a code structure comprising an abstract syntax tree (AST) and representing a plurality of functions, that at least one first function has a threshold degree of complexity based on the AST, wherein the AST comprises a plurality of nodes having node types and the threshold degree of complexity is expressed as a size of an abstract syntax sub-tree;
identifying, in response to the determination, a plurality of subfunctions based on the at least one first function, the plurality of subfunctions having a commonality with the at least one first function, wherein the identifying is based on the node types; and
forming a second function by reconfiguring the first function to call at least one of the identified plurality of subfunctions.