Odd word problem/TrivialCharacterStreamSupportForJ: Difference between revisions
Odd word problem/TrivialCharacterStreamSupportForJ (view source)
Revision as of 13:06, 7 August 2012
, 11 years agono edit summary
mNo edit summary |
No edit summary |
||
Line 5:
''Also, the language itself is designed to amortize interpreter overhead when the primitives deal directly with sequences rather than factoring so that primitives deal with [for example] a single character at a time. In other words, the language is radically more efficient on algorithms which treat sequences regularly than it is on algorithms which micro-manage data handling. This is in some ways analogous to the relationship between context dependent and context free languages, except that it's in the language's semantics rather than in the language's syntax.'''
''So it does not make much sense to implement some specialized implementation of sequences -- sequences which
Note that this implementation allows only one input stream and one output stream per locale (a J locale is roughly equivalent to a "namespace", or a "class" or an "object" or perhaps even a "stack frame (a call/cc context)" in another language)..
|