I am looking for efficient and easy in implementation algorithm for incremental parsing of expressions with brackets.Consider the example with expression like ((1)())(2). Parse tree for that expression is:((1)())(2)    ((1)())        (1)            1        ()    (2)        2Lets assume we inject additional symbols )( in the middle of the expression: ((1)()())(2). My question is how to apply changes in the parse tree without reparsing of the whole input?
Brackets expression incremental parsing algorithm
fl.formal languages;online algorithms;parsing;compilers