Parallel non-deterministic bottom-up parsing

Bernard Lang · 1971

The development of translator writing systems and extensible languages has led to a simultaneous development of more efficient and general syntax analyzers, usually for context-free (CF) syntax. Our paper describes a type of parser that can be used with reasonable efficiency for any CF grammar, even one which is ambiguous.

Read the paper · More papers on PaperTik