🏠 首页
基准测试
📊 所有基准测试 🦖 恐龙 v1 🦖 恐龙 v2 ✅ 待办事项应用 🎨 创意自由页面 🎯 FSACB - 终极展示 🌍 翻译基准测试
模型
🏆 前 10 名模型 🆓 免费模型 📋 所有模型 ⚙️ 🛠️ 千行代码模式
资源
💬 💬 提示库 📖 📖 AI 词汇表 🔗 🔗 有用链接
Advanced

Recursive Logic Parser

#logic #parsing #rules

Execute a series of conditional text transformations.

Process the input text according to these strictly conditional rules: 1) If a sentence contains a negation, invert the polarity of all adjectives within it. 2) If the text has more than 3 paragraphs, swap the second and second-to-last paragraphs. 3) If any proper noun is repeated more than twice, replace the third instance with a pronoun referencing the noun's role. Apply these rules recursively until no further changes occur, then output the final text.