{"id":5,"date":"2011-05-16T19:37:26","date_gmt":"2011-05-17T00:37:26","guid":{"rendered":"http:\/\/www.playwithlua.com\/?p=5"},"modified":"2020-05-22T13:13:01","modified_gmt":"2020-05-22T18:13:01","slug":"making-lua-look-like-prolog","status":"publish","type":"post","link":"http:\/\/www.playwithlua.com\/?p=5","title":{"rendered":"Making Lua Look Like Prolog"},"content":{"rendered":"

Lua, like most languages, has some object-oriented pieces. But, it doesn’t have classes and modules and objects: it takes the Scheme approach and gives you the tools you need to build<\/em> the OO paradigm you want to use. In particular, the only data structure it gives you is called a table<\/em> and is essentially a hashtable married to an array (it’s a hashtable, but it has accelerated access for integer keys, so it’s efficient to use for either one). Tables can be assigned metatables<\/em> which define special behavior for the table: if you try to access a key that doesn’t exist, it looks in the metatable for “__index” and uses that to find what the value should be.<\/p>\n

But if all that was intended was to make it easy to duplicate class-based OO, Lua would just have put in class-based OO, right? Let’s try something different, that uses this same trick to do something cool. Let’s make Lua look like Prolog.<\/p>\n

What we’re going to do is make it where we can refer to variables without creating them, and expect them to be automatically created for us with the right plumbing. We’ll do this by making a metatable with an __index method, and sticking it on to a special table called _G, where all the Lua global variables live. So let’s begin:<\/p>\n

Let’s say that any variable that begins with a capital letter is a noun, so we want to just create an empty table for it (that we can then use to store its relationships to other nouns).<\/p>\n

The next part of the __index function checks for any name that starts with “is_”. Since we’re going to create nouns and give them relationships to each other, we’ll want to query those somehow. So we’ll say that if (for example) the noun Bob is the boss of the noun Fred, then Fred will have boss = Bob as an entry in his table, and Bob will have boss_of = Fred. If someone asks for a function that starts with “is_”, we’ll make them a function that takes two nouns and returns whether they have that relationship. Here’s what the function to make those query functions looks like:<\/p>\n\n

function<\/span> make_predicate(<\/span>name)<\/span>\n   local<\/span> rule =<\/span> name:<\/span>match(<\/span>"^is_(.*)"<\/span>)<\/span>\n   return<\/span> function<\/span>(<\/span>a,<\/span> b)<\/span>\n             return<\/span> b[<\/span>rule]<\/span> ==<\/span> a\n          end<\/span>\nend<\/span><\/pre><\/div><\/div><\/div>\n\n
So now all we need is to make any other missing name be a function that assigns relationships. Here’s the function to create relationship-makers:<\/p>\n\n
function<\/span> make_rule(<\/span>name)<\/span>\n   return<\/span> function<\/span>(<\/span>a,<\/span> b)<\/span>\n             a[<\/span>name ..<\/span> "_of"<\/span>]<\/span> =<\/span> b\n             b[<\/span>name]<\/span> =<\/span> a\n          end<\/span>\nend<\/span><\/pre><\/div><\/div><\/div>\n\n
All that’s left is making the __index function that catches references to variables that don’t exist, and putting it in _G’s metatable:<\/p>\n\n
setmetatable<\/span>(<\/span>_G<\/span>,<\/span>{<\/span> __index =<\/span>\n                  function<\/span>(<\/span>globals<\/span>,<\/span> name)<\/span>\n                     if<\/span> name:<\/span>match(<\/span>"^[A-Z]"<\/span>)<\/span> then<\/span> -- entity<\/span>\n                        rawset<\/span>(<\/span>globals<\/span>,<\/span> name,<\/span> {<\/span> }<\/span>)<\/span>\n                     elseif<\/span> name:<\/span>match(<\/span>"^is_"<\/span>)<\/span> then<\/span> -- predicate<\/span>\n                        local<\/span> pred =<\/span> make_predicate(<\/span>name)<\/span>\n                        rawset<\/span>(<\/span>globals<\/span>,<\/span> name,<\/span> pred)<\/span>\n                     else<\/span> -- rule<\/span>\n                        local<\/span> rule =<\/span> make_rule(<\/span>name)<\/span>\n                        rawset<\/span>(<\/span>globals<\/span>,<\/span> name,<\/span> rule)<\/span>\n                     end<\/span>\n                     return<\/span> rawget<\/span>(<\/span>globals<\/span>,<\/span> name)<\/span>\n                  end<\/span> }<\/span>)<\/span><\/pre><\/div><\/div><\/div>\n\n
So now we’ve got a system where we can specify facts and then ask questions about them. It doesn’t have any kind of logical analyzer like an actual Prolog implementation would, but if you wrote one, this could be an excellent way to use Lua to feed facts to it. Let’s toss in a few now:<\/p>\n\n
father(<\/span>Vader,<\/span> Luke)<\/span>\nfather(<\/span>Vader,<\/span> Leia)<\/span>\n \nfriend(<\/span>Vader,<\/span> Emperor)<\/span>\nfriend(<\/span>Emperor,<\/span> Vader)<\/span>\nfriend(<\/span>Han,<\/span> Luke)<\/span>\nfriend(<\/span>Luke,<\/span> Han)<\/span>\n \nbrother(<\/span>Luke,<\/span> Leia)<\/span>\nsister(<\/span>Leia,<\/span> Luke)<\/span><\/pre><\/div><\/div><\/div>\n\n
And then a few asserts, to verify everything works:<\/p>\n\n
assert<\/span>(<\/span>is_father(<\/span>Vader,<\/span> Luke)<\/span>)<\/span>\nassert<\/span>(<\/span>is_sister(<\/span>Leia,<\/span> Luke)<\/span>)<\/span>\nassert<\/span>(<\/span>is_friend(<\/span>Han,<\/span> Luke)<\/span>)<\/span>\nassert<\/span>(<\/span>is_friend(<\/span>Luke,<\/span> Han)<\/span>)<\/span>\n \nassert<\/span>(<\/span>not<\/span> is_friend(<\/span>Vader,<\/span> Luke)<\/span>)<\/span>\nassert<\/span>(<\/span>not<\/span> is_friend(<\/span>Han,<\/span> Jabba)<\/span>)<\/span><\/pre><\/div><\/div><\/div>\n\n
And we’re done. You can see all this code in one place on Github here<\/a>.<\/p>\n
Lua and its metatables are really cool, and using them only to fake a boring language feature like classes is just a lack of imagination. It’s a really sharp tool, make cool things with it!<\/p>\n","protected":false},"excerpt":{"rendered":"
Lua, like most languages, has some object-oriented pieces. But, it doesn’t have classes and modules and objects: it takes the Scheme approach and gives you the tools you need to build the OO paradigm you want to use. In particular, the only data structure it gives you is called a table and is essentially a […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":[],"categories":[1],"tags":[],"_links":{"self":[{"href":"http:\/\/www.playwithlua.com\/index.php?rest_route=\/wp\/v2\/posts\/5"}],"collection":[{"href":"http:\/\/www.playwithlua.com\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/www.playwithlua.com\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/www.playwithlua.com\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/www.playwithlua.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=5"}],"version-history":[{"count":0,"href":"http:\/\/www.playwithlua.com\/index.php?rest_route=\/wp\/v2\/posts\/5\/revisions"}],"wp:attachment":[{"href":"http:\/\/www.playwithlua.com\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=5"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/www.playwithlua.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=5"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/www.playwithlua.com\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=5"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}