Agree with you for the general case but looking at the specialist case - do you think a bitc yacc or a bison will be of similar performance to c ? Anyway worst case we just handle the specialist case by converting to an array and parsing it which will be similar to other languages.
Ben > -----Original Message----- > > Where typesafe indexes (such as iterators in the non-vector case) are used, > which seems to be possible in the examples mentioned (regexp search, > substring), we are probably always talking about O(1) typical, so I don't know > where either of you are taking this discussion. > > And of course, you will want to allocate the indexes on the stack as far as > iteration goes, but given different instances of the String typeclass you don't > know how large they will have to be. One way to deal with this is by making > the iteration machinery special as in Go or common lisp. > > Is there some performance issue I'm not considering here? > > -- > William Leslie > _______________________________________________ > bitc-dev mailing list > [email protected] > http://www.coyotos.org/mailman/listinfo/bitc-dev _______________________________________________ bitc-dev mailing list [email protected] http://www.coyotos.org/mailman/listinfo/bitc-dev
