SWYN: A Visual Representation for Regular Expressions
نویسنده
چکیده
People find it difficult to create and maintain abstractions. We often deal with abstract tasks by using notations that make the structure of the abstraction visible. Programming-by-example (PBE) systems sometimes make it more difficult to create abstractions. The user has to second-guess the results of the inference algorithm and sometimes cannot see any visual representation of the inferred result, let alone manipulate it easily. SWYN (See What You Need) addresses these issues in the context of constructing regular expressions from examples. It provides a visual representation that has been evaluated in empirical user testing and an induction interface that always allows the user to see and modify the effects of the supplied examples. The results demonstrate the potential advantages of more strictly applying cognitive dimensions analysis and direct manipulation principles when designing systems for PBE.
منابع مشابه
Parsing Strings and Trees with Parse::Eyapp (An Introduction to Compiler Construction)
Parse::Eyapp (Extended yapp) is a collection of modules that extends Francois Desarmenien Parse::Yapp 1.05. Eyapp extends yacc/yapp syntax with functionalities like named attributes, EBNF-like expressions, modifiable default action, automatic syntax tree building, semi-automatic abstract syntax tree building, translation schemes, tree regular expressions, tree transformations, scope analysis su...
متن کاملThe Effect of Visual Representation, Textual Representation, and Glossing on Second Language Vocabulary Learning
In this study, the researcher chose three different vocabulary techniques (Visual Representation, Textual Enhancement, and Glossing) and compared them with traditional method of teaching vocabulary. 80 advanced EFL Learners were assigned as four intact groups (three experimental and one control group) through using a proficiency test and a vocabulary test as a pre-test. In the visual group, stu...
متن کاملSeries Parallel Digraphs with Loops Graphs Encoded by Regular Expression
In the conversion of finite automata to regular expressions, an exponential blowup in size can generally not be avoided. This is due to graph-structural properties of automata which cannot be directly encoded by regular expressions and cause the blowup combinatorially. In order to identify these structures, we generalize the class of arc-series-parallel digraphs beyond the acyclic case. The res...
متن کاملA Critical Visual Analysis of Gender Representation of ELT Materials from a Multimodal Perspective
This content analysis study, employing a multimodal perspective and critical visual analysis, set out to analyze gender representations in Top Notch series, one of the highly used ELT textbooks in Iran. For this purpose, six images were selected from these series and analyzed in terms of ‘representational’, ‘interactive’ and ‘compositional’ modes of meanings. The result indicated that there are...
متن کاملRegular Path Expression for Querying Semistructured Data - Implementation in Prolog
We present regular path expressions (RPE) a language for querying data graphs and its context free grammar implementation in Prolog. A proof of concept parser and query tool is implemented and various usage examples are analyzed for semistructured data formats like XML and JSON.
متن کامل