Hi,
I wonder if it is possible to have dynamic word resolution akin the
"method_missing" like methods in OO languages (invoked as a fallback if
a method is not defined).
Eg: say I want all words which look as follows:
- a sequence of alphabetic characters, with no repetition
- followed by dash-dash ("--")
- followed by some sequence of the characters which occurred before
the dash-dash
to act as shuffle words with stack effect corresponding to the name of
the word. That is,
xyzpq--ppqqqx
would be then resolved as a shuffle word with stack effect
(xyzpq -- ppqqqx).
Is this possible to implement? (Sure it is possible within a special
parsing scope, delimited by some parsing words. My question regards
to having such a semantics in the language thoroughout.)
Csaba
-------------------------------------------------------------------------
Take Surveys. Earn Cash. Influence the Future of IT
Join SourceForge.net's Techsay panel and you'll get the chance to share your
opinions on IT & business topics through brief surveys-and earn cash
http://www.techsay.com/default.php?page=join.php&p=sourceforge&CID=DEVDEV
_______________________________________________
Factor-talk mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/factor-talk
