What I'm interested in is the performance implications of context-free parsing of some arbituary data without a length field.
Someone asked this in the talk and a paper was referenced and she thought context free could be faster but I don't really have time to read it.
Let's say you get delimited data over a network socket and no length field. How do you know how big to make your receive buffer without losing efficiency (i.e scanning the data twice or allocating more than you need) or re-allocating and copying the buffer at some interval?
What I'm interested in is the performance implications of context-free parsing of some arbituary data without a length field.
Someone asked this in the talk and a paper was referenced and she thought context free could be faster but I don't really have time to read it.
Let's say you get delimited data over a network socket and no length field. How do you know how big to make your receive buffer without losing efficiency (i.e scanning the data twice or allocating more than you need) or re-allocating and copying the buffer at some interval?