Главная
Study mode:
on
1
APL for processing text data
2
Most text parsing tasks result in a structured model such as a tree
3
Regular expressions regex are convenient but limited
4
Parsing expression grammars are recursive
5
Issues with a recursive parser
6
Performance of recursive parsers
7
How to do data-parallel, idiomatic parsing
8
Balanced parentheses example
9
High level overview of the new co-dfns parser
10
Link variables to their bindings example
11
Parsing strands example
12
Notes on flexibility, maintainability and performance
Description:
Explore text processing capabilities in APL through this 25-minute conference talk from Dyalog '22. Dive into parsing techniques, architectural considerations, and handling text-oriented applications. Learn about structured models for parsing tasks, limitations of regular expressions, and recursive parsing expression grammars. Examine performance issues with recursive parsers and discover data-parallel, idiomatic parsing approaches. Follow along with practical examples including balanced parentheses parsing and variable binding. Gain insights into the new co-dfns parser and its advantages. Conclude with valuable notes on achieving flexibility, maintainability, and performance in APL text processing applications.

Text Processing in APL - Data-Parallel and Idiomatic Parsing Techniques

Dyalog User Meetings
Add to list